Given a matrix of positive weights, finds the minimum weight bipartite matching between to arrays.
Given a matrix of positive weights, finds the minimum weight bipartite matching between to arrays. Returns a matching from the rows (the first index into the matrix) to the columns (-1 for unmatched rows in the case of unbalanced entries) along with the total score of the matching.
Algorithm to find a minimum cost matching on a bipartite graph.
Implements the hungarian algorithm.