Module matching

Expand description

Graph matching algorithms

This module contains algorithms for finding matchings in graphs, particularly bipartite matchings.

Structs§

maximal_matching: Finds a maximal matching using a greedy algorithm
maximum_bipartite_matching: Finds a maximum bipartite matching using the Hungarian algorithm
maximum_cardinality_matching: Finds a maximum cardinality matching in a general graph using Edmonds’ blossom algorithm
minimum_weight_bipartite_matching: Minimum weight bipartite matching using a simplified Hungarian algorithm
stable_marriage: Stable marriage problem solver using the Gale-Shapley algorithm