Class  Description 

EdmondsBlossomShrinking<V,E> 
An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on
graphs.

GreedyWeightedMatching<V,E> 
The greedy algorithm for computing a maximum weight matching in an arbitrary graph.

HopcroftKarpBipartiteMatching<V,E> 
This class is an implementation of the HopcroftKarp algorithm which finds a maximum matching in
an undirected simple bipartite graph.

KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> 
KuhnMunkres algorithm (named in honor of Harold Kuhn and James Munkres) solving assignment
problem also known as hungarian
algorithm (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).

MaximumWeightBipartiteMatching<V,E> 
This class finds a maximum weight matching of a simple undirected weighted bipartite graph.

PathGrowingWeightedMatching<V,E> 
A linear time 1/2approximation algorithm for finding a maximum weight matching in an arbitrary
graph.

Copyright © 2017. All rights reserved.