Munkres implementation for Python

Abandonware Alert: I am no longer maintaining this package. If you would like to take over ownership of it, please contact me or open an issue, and I will gladly hand it off to you and link to your version in this README.

Introduction

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 ith worker to the jth 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 https://csclab.murraystate.edu/~bob.pilgrim/445/munkres.html.

See the docs on the project page for more details.

WARNING: As of version 1.1.0, munkres no longer supports Python 2. If you need to use this package with Python 2, install an earlier version. See the installation instructions for details.

Copyright

© 2008-2019 Brian M. Clapper

License

Licensed under the Apache License, Version 2.0. See LICENSE for details.