BitGraph.Algorithms.Matching.Kuhn (bitgraph v0.1.21)
Maximum Matching for bipartite graph (Kuhn algorithm). Implementation mostly follows https://cp-algorithms.com/graph/kuhn_maximum_bipartite_matching.html
Summary
Functions
graph
- bipartite graph.
left_partition
- list or set of vertices that represent either part of graph
.
Functions
@spec run(BitGraph.t(), MapSet | list(), Keyword.t()) :: %{matching: Map.t(), free: MapSet.t()} | nil
graph
- bipartite graph.
left_partition
- list or set of vertices that represent either part of graph
.
Options:
- :fixed_matching (optional) - The edges that have to be in matching. This is a
left_vertex => right vertex
, whereleft_vertex
is a vertex fromleft_partition
- :required_size (optional) - The required size of maximum matching. If not reached, algorithm returns
nil
Output: map with keys
- :matching - map of left_vertex => right_vertex
- :free - unmatched vertices from right partition