CPSolver.Algorithms.Kuhn (Fixpoint v0.12.6)
Kuhn's algorithm to find maximum matching in bipartite graph. https://cp-algorithms.com/graph/kuhn_maximum_bipartite_matching.html
Link to this section Summary
Functions
Given the bipartite graph, a list of vertices int the left partition, and (optional) partial matching %{right_side_vertex => left_side_vertex}, find maximum matching
Link to this section Functions
Link to this function
initial_matching(graph, left_partition, fixed_matching \\ %{})
Link to this function
run(graph, left_partition, fixed_matching \\ %{}, required_matching_size \\ nil)
Given the bipartite graph, a list of vertices int the left partition, and (optional) partial matching %{right_side_vertex => left_side_vertex}, find maximum matching