Munkres

Munkres' assignment algorithm (hungarian method)

Latest on Hackage:0.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Balazs Komuves
Maintained by bkomuves (plus) hackage (at) gmail (dot) com

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.

Depends on:
Used by 1 package:
comments powered byDisqus