
Very nice tutorial :)
Some weeks ago i tried to implement the hungarian algorithm but failed, this tutorial comes in the right time :)
Just one question, are there better algorithms to find the maximum/minimum weight perfect matching in bipartite grahps? [like O(N^2 log N ) ..] 