munkres
Munkres (Hungarian) algorithm for the Assignment Problem
Decision gist · record as of 2026-08-14
Yes, if you need a lightweight, dependency-free implementation of the Munkres algorithm for a stable, non-evolving use case. The permissive license and low install friction make it accessible. However, the abandoned status (no updates since 2020-09-15) means you should verify the implementation meets your accuracy and performance needs before adopting it in new production systems.AI-flagged interpretation of the facts on this page — verify before relying
Before you install
- Installation is frictionless—a pure Python wheel with no runtime dependencies.
- However, the package has been abandoned since 2020 (2159 days since last release), so it will not receive bug fixes or updates.
License · maintenance · safety
Apache Software License (permissive) — Licensed under Apache Software License (permissive), so you can use it freely in commercial and open-source projects without restrictive obligations.
last release 2020-09-15 (2159 days)
0 known vulnerabilities (OSV.dev, 2026-08-14) · 476,781 downloads/mo, #6,446 on PyPI
Alternatives
Verify before relying
pip install munkres
from munkres import Munkres
m = Munkres()
cost_matrix = [[1, 2], [3, 4]]
indexes = m.compute(cost_matrix)- Whether the implementation handles edge cases (empty matrices, rectangular cost matrices) correctly
- Performance characteristics on large matrices and suitability for your specific use case
- Compatibility with current Python versions beyond what the fact sheet specifies
What it is and what it does
Munkres is a pure-Python implementation of the Munkres algorithm, a classical algorithm for solving the Assignment Problem—finding an optimal one-to-one matching between two sets of items given a cost matrix. The algorithm is also known as the Hungarian algorithm or Kuhn-Munkres algorithm.
The package provides a straightforward interface to compute the minimum-cost assignment. It has no external runtime dependencies, making it lightweight and easy to integrate. However, the project has been abandoned since its last release on 2020-09-15, meaning no new features or bug fixes will be added. For production use, you should verify that the implementation meets your numerical accuracy and performance requirements.
Use it for
- Solving assignment problems in operations research: assigning workers to tasks or resources to projects.
- Object tracking in computer vision: matching detected objects across frames by minimizing distance.
- Bipartite graph matching: finding optimal pairings between two sets of nodes in network analysis.
- Logistics and transportation: assigning delivery routes or vehicles to minimize total cost.
Worth the install?
AI-flagged interpretation of the facts on this page. Verify before relying on it.
Yes, if you need a lightweight, dependency-free implementation of the Munkres algorithm for a stable, non-evolving use case.
The permissive license and low install friction make it accessible. However, the abandoned status (no updates since 2020-09-15) means you should verify the implementation meets your accuracy and performance needs before adopting it in new production systems.
Install
munkres on PyPI
Before you install
Installation is frictionless—a pure Python wheel with no runtime dependencies. However, the package has been abandoned since 2020 (2159 days since last release), so it will not receive bug fixes or updates.
License in practice
Licensed under Apache Software License (permissive), so you can use it freely in commercial and open-source projects without restrictive obligations.
Quickstart
pip install munkres
from munkres import Munkres
m = Munkres()
cost_matrix = [[1, 2], [3, 4]]
indexes = m.compute(cost_matrix)Verify before relying
- Whether the implementation handles edge cases (empty matrices, rectangular cost matrices) correctly
- Performance characteristics on large matrices and suitability for your specific use case
- Compatibility with current Python versions beyond what the fact sheet specifies
Package facts
| License | Apache Software License permissive |
| Python support | Not specified |
| Install friction | Low. Pure-Python wheel |
| Runtime dependencies | None |
| Maintenance | Abandoned 2,159 days since the last release |
| First released | |
| Downloads | 476,781 / month, #6,446 on PyPI 30-day window, as of 2026-08-14 |
| Known vulnerabilities | None known OSV.dev, checked 2026-08-14 |
| Classifiers | Intended Audience :: DevelopersIntended Audience :: Science/ResearchLicense :: OSI Approved :: Apache Software LicenseOperating System :: OS IndependentProgramming Language :: PythonTopic :: Scientific/Engineering :: MathematicsTopic :: Software Development :: Libraries :: Python Modules |
Evidence: munkres-1.1.4-py2.py3-none-any.whl
Tags
Let your AI agent find packages like this
Example. Real query, live index.
You found this page by searching. An agent finds it by wishing: SkillFed indexes 14,416 PyPI packages by what they can do, searchable in plain language.
wish › “munkres algorithm”
- munkresImplements the Munkres algorithm (Hungarian algorithm) to solve the…
- motmetricsComputes multiple object tracker (MOT) evaluation metrics including…
- panphonPanPhon maps International Phonetic Alphabet (IPA) segments to…
Give your agent the search over MCP, or paste the wish link into any chat.
More Python Modules packages
Converts domain names between Unicode and ASCII-compatible encoding (Punycode) according to IDNA 2008 and Unicode Technical Standard 46, with security validation and broader script coverage than the standard library.
Install it if you work with internationalized domain names, need to validate domains, or use HTTP clients that depend on it transitively.
Setuptools is a Python build backend and package management tool that handles building, distributing, and installing Python packages, including support for C/C++ extension modules.
PyYAML parses and emits YAML 1.1 data format, enabling serialization and deserialization of configuration files and Python objects to and from human-readable YAML text.
Pydantic validates Python data structures against type hints, coercing and checking input at runtime to ensure it matches a declared schema.
Provides reusable metadata objects for use with PEP-593 `typing.Annotated` to express common constraints like bounds, collection sizes, and predicates on types.
Install it if you use or build libraries that need to express type constraints in a standardized, inspectable way—or if you want to annotate your own types with…
Provides runtime tools to inspect and introspect Python type annotations, enabling programmatic examination of type hints at execution time.
See also lap · lapx · k-means-constrained · Dijkstar · rectpack · klujax · quadprog · qpsolvers · POT · iterative-ensemble-smoother