python-munkres
Munkres implementation for Python
The Munkres module provides an O(n^3) implementation of the Munkres algorithm (also called the Hungarian algorithm or the Kuhn-Munkres algorithm). The algorithm models an assignment problem as an NxM cost matrix, where each element represents the cost of assigning the i'th worker to the j'th job, and it figures out the least-cost solution, choosing a single item from each row and column in the matrix, such that no row and no column are used more than once. This particular implementation is based on <a href="http://csclab.murraystate.edu/~bob.pilgrim/445/munkres.html">http://csclab.murraystate.edu/~bob.pilgrim/445/munkres.html</a> .
openSUSE Leap 16.0 हेतु कोई आधिकारिक पैकेज उपलब्ध नहीं हैवितरण
openSUSE Tumbleweed
openSUSE Leap 16.0
openSUSE Leap 15.6
openSUSE Leap 15.5
openSUSE Backports for SLE 15 SP7
openSUSE Backports for SLE 15 SP4
SUSE SLE-15-SP1