@hackage Munkres0.1

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.

  • Installation

  • Dependencies (0)

  • Dependents (0)

    • Package Flags

      splitbase
       (on by default)

      Choose the new smaller, split-up base package.

      debug
       (off by default)

      Debugging tools