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.


Versions 0.1
Dependencies array, base, random [details]
License BSD3
Copyright (c) 2008 Balazs Komuves
Author Balazs Komuves
Maintainer bkomuves (plus) hackage (at) gmail (dot) com
Category Algorithms
Uploaded Sun Dec 7 18:17:30 UTC 2008 by BalazsKomuves
Distributions NixOS:0.1
Downloads 512 total (10 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI




splitbaseChoose the new smaller, split-up base package.EnabledAutomatic
debugDebugging toolsDisabledAutomatic

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


Maintainer's Corner

For package maintainers and hackage trustees