genetic algorithm matlab tic-tac-toe algorithm aes algorithm crc32 algorithm curve fitting algorithm hungarian phrase book hungarian windows
Description - Hungarian Algorithm
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.
