@hackage / Munkres

Munkres' assignment algorithm (hungarian method)

Latest0.1

About

Metadata

  • Last updated , by BalazsKomuves
  • License BSD-3-Clause
  • Categories Algorithms

  • Maintained by: bkomuves (plus) hackage (at) gmail (dot) com

  • Lottery factor: 0

Links

Installation

Package Flags

Use the -f option with cabal commands to enable flags

    splitbase (on by default)

    Choose the new smaller, split-up base package.

    debug (off by default)

    Debugging tools

Readme

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.