maximum_cardinality_matching

scirs2_graph::algorithms::matching

Function maximum_cardinality_matching 

Source 
pub fn maximum_cardinality_matching<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
) -> MaximumMatching<N>
where
    N: Node + Clone + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Finds a maximum cardinality matching in a general graph using Edmonds’ blossom algorithm

This is a simplified implementation of the blossom algorithm for general graphs. For better performance on bipartite graphs, use maximum_bipartite_matching.

§Arguments

  • graph - The input graph

§Returns

  • A maximum cardinality matching