Module matching 

Bipartite matching algorithms.

Provides:

• is_matching — validate a matching vector against a graph
• is_maximal_matching — check whether a valid matching is maximal
• maximum_bipartite_matching — maximum cardinality bipartite matching (push-relabel, unweighted)
• maximum_bipartite_matching_weighted — maximum weight bipartite matching (Hungarian / Kuhn-Munkres)

Reference: igraph/src/misc/matching.c (1013 lines).

Structs

MatchingResult

Result of maximum_bipartite_matching or maximum_bipartite_matching_weighted.

Functions

is_matching

Check whether matching is a valid matching for graph.

is_maximal_matching

Check whether matching is a maximal matching for graph.

maximum_bipartite_matching

Compute a maximum cardinality matching in an unweighted bipartite graph.

maximum_bipartite_matching_weighted

Compute a maximum weight matching in a weighted bipartite graph.