Munkres: Munkres' assignment algorithm (hungarian method)
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.
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| splitbase | Choose the new smaller, split-up base package. | Enabled |
| debug | Debugging tools | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- Munkres-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1 |
|---|---|
| Dependencies | array, base, random [details] |
| Tested with | ghc ==6.10.1 |
| License | BSD-3-Clause |
| Copyright | (c) 2008 Balazs Komuves |
| Author | Balazs Komuves |
| Maintainer | bkomuves (plus) hackage (at) gmail (dot) com |
| Category | Algorithms |
| Uploaded | by BalazsKomuves at 2008-12-07T18:17:30Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 1664 total (7 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |