No BSD License  

image thumbnail

Hungarian Algorithm

by

 

30 Jun 2006 (Updated )

An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.

Hungarian(Perf)

Contact us