image thumbnail

updated 8 years ago

Hungarian Algorithm by Alexander Melin

An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. (optimization, minimum, maximum)

Contact us