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

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

Branch: pkgsrc-2018Q2, Version: 1.0.11, Package name: py27-munkres-1.0.11, 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:
[devel/py-setuptools] [lang/python27]

Required to build:
[pkgtools/cwrappers]

Master sites:

SHA1: b32cd39ec9e2eefb4db52c1ff4b2ac0f5df0b2c0
RMD160: d79235c896c26ea7a99c6fdc644935969ca73e8f
Filesize: 11.057 KB

Version history: (Expand)