[Lemon-user] Munkres Algorithm

[Alpar Juttner]

Hi,

> I wonder if LEMON provides a solution for Munkres assignment
> algorithm.

Not yet in the stable release. However you can substitute it either with
      * the Edmonds' algorithm for finding min. cost matching in an
        arbitrary (not only in bipartite) graphs, or with
      * one of the minimum cost network flow implementation (e.g Network
        simplex of Cost scaling)

Both should be at least as fast as the original Munkres(*) algorithm,
the second one is probably being much faster.

Best regards,
Alpar

(*) For some reason, we prefer to call it the "Hungarian method", coined
by Harold Kuhn.