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".
openSUSE Leap 15.5 没有可用的官方软件包发行版
openSUSE Tumbleweed
openSUSE Leap 15.5
openSUSE Leap 15.4