The Munkres package
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.
Properties
| Version | 0.1 |
|---|---|
| Dependencies | base (<3) or array, base (≥3) |
| License | BSD3 |
| Copyright | (c) 2008 Balazs Komuves |
| Author | Balazs Komuves |
| Maintainer | bkomuves (plus) hackage (at) gmail (dot) com |
| Stability | Experimental |
| Category | Algorithms |
| Upload date | Sun Dec 7 18:17:30 UTC 2008 |
| Uploaded by | BalazsKomuves |
| Built on | ghc-6.10, ghc-6.12, ghc-7.0 |
Modules
- Data
- Algorithm
Downloads
- Munkres-0.1.tar.gz (Cabal source package)
- package description (included in the package)