The Munkres package

[Tags: bsd3, library]

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

Version0.1
Dependenciesbase (<3) or
array, base (>=3)
LicenseBSD3
Copyright(c) 2008 Balazs Komuves
AuthorBalazs Komuves
Maintainerbkomuves (plus) hackage (at) gmail (dot) com
StabilityExperimental
CategoryAlgorithms
UploadedSun Dec 7 18:17:30 UTC 2008 by BalazsKomuves
Downloads233 total (13 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Flags

NameDescriptionDefault
splitbaseChoose the new smaller, split-up base package.Enabled
debugDebugging toolsDisabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainers' corner

For package maintainers and hackage trustees