The Munkres module provides an implementation of the Munkres algorithm (also called the Hungarian algorithm or the Kuhn-Munkres algorithm). The algorithm models an assignment problem as an N×M 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.
See the docs in munkres.js for more details.
This module is a translation of a Python implementation by Brian Clapper.
It is available via bower and npm as munkres-js.
© 2014 Hauke Henningsen (Conversion to JS)
© 2008 Brian M. Clapper
BSD license. See accompanying LICENSE file.
FAQs
Munkres (aka Hungarian) algorithm for JS
The npm package munkres-js receives a total of 13,542 weekly downloads. As such, munkres-js popularity was classified as popular.
We found that munkres-js demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Research
A malicious npm package disguised as a WhatsApp client is exploiting authentication flows with a remote kill switch to exfiltrate data and destroy files.
Security News
PyPI now supports digital attestations, enhancing security and trust by allowing package maintainers to verify the authenticity of Python packages.
Security News
GitHub removed 27 malicious pull requests attempting to inject harmful code across multiple open source repositories, in another round of low-effort attacks.
