perl-Algorithm-Kuhn-Munkres

Determines the maximum weight perfect matching in a weighted complete bi[cut]

Implementation of the Kuhn-Munkres algorithm. The algorithm finds the maximum weight perfect matching in a weighted complete bipartite graph. This problem is also known as the "Assignment Problem".

Er is geen officieel pakket voor openSUSE Leap 15.5 beschikbaar