This class finds a maximum weight matching of a simple undirected weighted bipartite graph. The
algorithm runs in O(V|E|^2). The algorithm is described in The LEDA Platform of Combinatorial and
Geometric Computing, Cambridge University Press, 1999.
https://people.mpi-inf.mpg.de/~mehlhorn/LEDAbook.html Note: the input graph must be bipartite
with positive integer edge weights
Nested Class Summary
Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.MatchingAlgorithm