Path to this page:
./
math/pymunkres,
Munkres algorithm for the Assignment Problem
Branch: CURRENT,
Version: 1.0.11,
Package name: py27munkres1.0.11,
Maintainer: pkgsrcusersThe Munkres module provides an implementation of the Munkres
algorithm (also called the Hungarian algorithm or the KuhnMunkres
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/pysetuptools] [
lang/python27]
Required to build:[
pkgtools/cwrappers]
Master sites:
SHA1: b32cd39ec9e2eefb4db52c1ff4b2ac0f5df0b2c0
RMD160: d79235c896c26ea7a99c6fdc644935969ca73e8f
Filesize: 11.057 KB
Version history: (Expand)
 (20170724) Updated to version: py27munkres1.0.11
 (20140121) Updated to version: py27munkres1.0.6
 (20120530) Package added to pkgsrc.se, version py27munkres1.0.5.4 (created)
CVS history: (Expand)
20170904 20:08:31 by Thomas Klausner  Files touched by this commit (163) 
Log message:
Follow some redirects.

20170723 20:39:51 by Adam Ciarcinski  Files touched by this commit (3) 
Log message:
Version 1.0.11:
Docs are now generated with pdoc.
Merged Pull Request 24, from @czlee:
* Change to step 4: When it looks for a uncovered zero, rather than starting at \
row 0, column 0, it starts where it left off, i.e. at the last uncovered zero it \
found. Since it doesn't start at (0,0), when it gets to the last column it now \
loops around to the first, and exits unsuccessfully if it got back to where it \
started. This change reduces this reduces the solving time for (certain) large \
matrices. For instance, in tests, solving a matrix of size 394Ã394 goes from \
about 2 minutes to about 4 seconds.
* Since Python 3 started cracking down on unnatural comparisons, the DISALLOWED \
constant added in Pull Request 19 no longer works. (It raises a TypeError for \
unorderable types, as is expected in Python 3.) Since this constant is meant to \
act like infinity, this modification just changes the two lines where it would \
otherwise try to make an illegal (in Python 3) comparison between a number and \
DISALLOWED_OBJ() and gets it to behave as if DISALLOWED is always larger.
Added Travis CI integration.
Added some unit tests. See tests and tests/README.md.

20160608 19:43:49 by Thomas Klausner  Files touched by this commit (356) 
Log message:
Switch to MASTER_SITES_PYPI.

20151104 00:33:46 by Alistair G. Crooks  Files touched by this commit (262) 
Log message:
Add SHA512 digests for distfiles for math category
Problems found locating distfiles:
Package dfftpack: missing distfile dfftpack20001209.tar.gz
Package eispack: missing distfile eispack20001130.tar.gz
Package fftpack: missing distfile fftpack20001130.tar.gz
Package linpack: missing distfile linpack20010510.tar.gz
Package minpack: missing distfile minpack20001130.tar.gz
Package odepack: missing distfile odepack20001130.tar.gz
Package pynetworkx: missing distfile networkx1.10.tar.gz
Package pysympy: missing distfile sympy0.7.6.1.tar.gz
Package quadpack: missing distfile quadpack20001130.tar.gz
Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden). All existing
SHA1 digests retained for now as an audit trail.

20140120 21:26:39 by Thomas Klausner  Files touched by this commit (2)  
Log message:
Update to 1.0.6: changes not found, but this version works with python3.

20120912 01:04:36 by Aleksej Saushev  Files touched by this commit (180) 
Log message:
"userdestdir" is default these days

20120530 13:05:30 by Thomas Klausner  Files touched by this commit (4)  
Log message:
Initial import of pymunkres1.0.5.4:
The Munkres module provides an implementation of the Munkres
algorithm (also called the Hungarian algorithm or the KuhnMunkres
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.
