Uses of Interface
org.jgrapht.alg.interfaces.MatchingAlgorithm
Package
Description
Algorithms for the computation of matchings.
Package for Kolmogorov's Blossom V algorithm

Uses of MatchingAlgorithm in org.jgrapht.alg.matching
Modifier and TypeClassDescriptionclass
This implementation of Edmonds' blossom algorithm computes maximum cardinality matchings in undirected graphs.class
The greedy algorithm for computing a maximum cardinality matching.class
The greedy algorithm for computing a maximum weight matching in an arbitrary graph.class
Implementation of the wellknown Hopcroft Karp algorithm to compute a matching of maximum cardinality in a bipartite graph.class
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).class
Maximum weight matching in bipartite graphs.class
A linear time $\frac{1}{2}$approximation algorithm for finding a maximum weight matching in an arbitrary graph.class
Edmonds' blossom algorithm for maximum cardinality matching in general undirected graphs.ModifierConstructorDescriptionDenseEdmondsMaximumCardinalityMatching
(Graph<V, E> graph, MatchingAlgorithm<V, E> initializer) Constructs a new instance of the algorithm.SparseEdmondsMaximumCardinalityMatching
(Graph<V, E> graph, MatchingAlgorithm<V, E> initializer) Constructs a new instance of the algorithm. 
Uses of MatchingAlgorithm in org.jgrapht.alg.matching.blossom.v5
Modifier and TypeClassDescriptionclass
This class computes weighted matchings in general graphs.class
This class computes weighted perfect matchings in general graphs using the Blossom V algorithm.