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