Hungarian Algorithm (Scripts) Publisher's description
from Alexander Melin
This algorithm allows you to find the minimum weight matching of a bipartite graph
This algorithm allows you to find the minimum weight matching of a bipartite graph. The graph can be of arbitrary size and connectedness. The edge weights are captured by a MxN weight matrix where an infinite(Inf) weight designates that that pair of vertices given by that position are not connected.
System Requirements:MATLAB 7.2 (R2006a)
Program Release Status: New Release
Program Install Support: Install and Uninstall