Class  Description 

EdmondsMaximumCardinalityMatching<V,E> 
This implementation of Edmonds' blossom algorithm computes maximum cardinality matchings in
undirected graphs.

GreedyMaximumCardinalityMatching<V,E> 
A simple class which computes a random, maximum cardinality matching.

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

HopcroftKarpMaximumCardinalityBipartiteMatching<V,E> 
Implementation of the wellknown Hopcroft Karp algorithm to compute a matching of maximum
cardinality in a 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> 
Maximum weight matching in bipartite graphs.

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

Copyright © 2018. All rights reserved.