Path to this page:
./

math/py-munkres,

*Munkres algorithm for the Assignment Problem*

**Branch:** pkgsrc-2020Q2,

**Version: **1.0.12,

**Package name:** py37-munkres-1.0.12,

**Maintainer: **pkgsrc-usersThe Munkres module provides an implementation of the Munkres

algorithm (also called the Hungarian algorithm or the Kuhn-Munkres

algorithm), useful for solving the Assignment Problem.

Assignment Problem: Let C be an nxn matrix representing the costs

of each of n workers to perform any of n jobs. The assignment

problem is to assign jobs to workers in a way that minimizes the

total cost. Since each worker can perform only one job and each

job can be assigned to only one worker the assignments represent

an independent set of the matrix C.

**Required to run:**[

lang/python37] [

devel/py-setuptools]

### Master sites:

**SHA1:** 8e50cfe8cfde5f7be250476fab34d108a7b0aa16

**RMD160:** 64145a12881cd8f0edbda4a9d2e14808efe1df70

**Filesize:** 11.842 KB

### Version history: (Expand)

- (
**2020-07-01**) Package added to pkgsrc.se, version **py37-munkres-1.0.12** (created)