Kuhn-Munkres Hungarian Method

This implementation of Hungarian Method (bipartite graph version) is written in C++. It outputs algorithmic details that allow one to understand and track what happens. Animation from GNUplot is also available under linux systems. Note, the practical time complexity of this implementation is more than O(n^3).It should be around O(n^4).

An example illustrating how the algorithm searches for augmenting paths and improves the matching.