Munkres
Version 0.1 revision 0 uploaded by BalazsKomuves.
Package meta
- Synopsis
- Munkres' assignment algorithm (hungarian method)
- Description
The Munkres algorithm solves the weighted minimum matching problem in a complete bipartite graph, in O(n^3) time. This problem is often called the 'assignment problem'. See eg. http://en.wikipedia.org/wiki/Hungarian_algorithm.
- Author
- Balazs Komuves
- Bug reports
- n/a
- Category
- Algorithms
- Copyright
- (c) 2008 Balazs Komuves
- Homepage
- n/a
- Maintainer
- bkomuves (plus) hackage (at) gmail (dot) com
- Package URL
- n/a
- Stability
- Experimental