Skip to content
Munkres algorithm for Python
Branch: master
Clone or download
bmc Removed NoReturn type annotations, to allow compatibility with Python…
… 3.5 releases prior to 3.5.4. Thanks to @jackwilsdon for catching that issue.
Latest commit 5badef0 Feb 15, 2019

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 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

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.


© 2008-2019 Brian M. Clapper


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

You can’t perform that action at this time.