Module pathfinding::kuhn_munkres
source · Expand description
Compute a maximum weight maximum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm).
Traits
Adjacency matrix for weights.
Functions
Compute a maximum weight maximum matching between two disjoints sets of
vertices using the
Kuhn-Munkres algorithm
(also known as Hungarian algorithm).
Compute a minimum weight maximum matching between two disjoints sets of
vertices using the
Kuhn-Munkres algorithm
(also known as Hungarian algorithm).