./math/py-munkres, Munkres algorithm for the Assignment Problem

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2017Q2, Version: 1.0.6, Package name: py27-munkres-1.0.6, Maintainer: pkgsrc-users

The 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/python27]

Master sites:

SHA1: f5115fe4df109d8ef04e51e1c3799caded84d66d
RMD160: 21db2ea164f20a829b8c6b3faf691cfb8ec5e625
Filesize: 9.61 KB

Version history: (Expand)