Skip to main content

A fork of munkres

Project description

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.

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

jk-munkres-1.2.0.tar.gz (13.6 kB view hashes)

Uploaded Source

Built Distribution

jk_munkres-1.2.0-py3-none-any.whl (8.1 kB view hashes)

Uploaded Python 3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page