@hackage Munkres0.1

Munkres' assignment algorithm (hungarian method)

  • Categories

  • License

    BSD-3-Clause

  • Maintainer

    bkomuves (plus) hackage (at) gmail (dot) com

  • Links

  • Versions

    • 0.1 Sun, 7 Dec 2008

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.