maximum_bipartite_matching

scirs2_graph::algorithms::matching

Function maximum_bipartite_matching 

Source 
pub fn maximum_bipartite_matching<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
    coloring: &HashMap<N, u8>,
) -> BipartiteMatching<N>
where
    N: Node + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Finds a maximum bipartite matching using the Hungarian algorithm

Assumes the graph is bipartite with nodes already colored.

§Arguments

  • graph - The bipartite graph
  • coloring - The bipartite coloring (0 or 1 for each node)

§Returns

  • A maximum bipartite matching