Expand description
Graph matching algorithms.
Re-exports§
pub use blossom_v_simple::blossom_match_unweighted;pub use hopcroft_karp::hopcroft_karp_matching;pub use hungarian_munkres::hungarian_assignment;pub use weighted_general::WeightedGeneralMatching;pub use weighted_general::WeightedMatchingResult;
Modules§
- blossom_
v_ simple - Simplified blossom-based maximum matching on general (non-bipartite) graphs.
- hopcroft_
karp - Hopcroft-Karp bipartite matching, O(E * sqrt(V)).
- hungarian_
munkres - Hungarian (Kuhn-Munkres) algorithm for min-cost assignment in O(n^3).
- weighted_
general - Maximum-weight matching on a general (non-bipartite) weighted graph.