Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

# networkx.algorithms.bipartite.matching.maximum_matching¶

maximum_matching(G, top_nodes=None)

Returns the maximum cardinality matching in the given bipartite graph.

This function is simply an alias for hopcroft_karp_matching().