provides an implementation of the Munkres algorithm in python.
The Munkres module provides an implementation of the Munkres algorithm (also called the Hungarian algorithm or the Kuhn-Munkres algorithm), useful for solving the Assignment Problem.
released on 2 January 2017
2 September 2009
Leaders and contributors
|Brian M. Clapper||Maintainer|
Resources and communication
|Developer||VCS Repository Webview||http://github.com/bmc/munkres/tree/master|
This entry (in part or in whole) was last reviewed on 16 April 2018.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.