/// <summary> /// Utility to maximise an existing matching of the provided graph. /// </summary> /// <param name="g">a graph</param> /// <param name="m">matching on the graph, will me modified</param> /// <param name="n">current matching cardinality</param> /// <param name="s">subset of vertices to match</param> /// <returns>the maximal matching on the graph</returns> public static int Maximise(Graph g, Matching m, int n, IntSet s) { MaximumMatching mm = new MaximumMatching(g, m, n, s); return(mm.nMatched); }