Uses of Interface
org.jgrapht.alg.interfaces.MatchingAlgorithm
-
Packages that use MatchingAlgorithm Package Description org.jgrapht.alg Algorithms provided with JGraphT.org.jgrapht.alg.interfaces Algorithm related interfaces.org.jgrapht.alg.matching Algorithms for the computation of matchings. -
-
Uses of MatchingAlgorithm in org.jgrapht.alg
Classes in org.jgrapht.alg that implement MatchingAlgorithm Modifier and Type Class Description class
EdmondsBlossomShrinking<V,E>
Deprecated.UseEdmondsBlossomShrinking
instead.class
HopcroftKarpBipartiteMatching<V,E>
Deprecated.UseHopcroftKarpBipartiteMatching
instead.class
KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E>
Deprecated.UseKuhnMunkresMinimalWeightBipartitePerfectMatching
instead.class
MaximumWeightBipartiteMatching<V,E>
Deprecated.UseMaximumWeightBipartiteMatching
instead. -
Uses of MatchingAlgorithm in org.jgrapht.alg.interfaces
Subinterfaces of MatchingAlgorithm in org.jgrapht.alg.interfaces Modifier and Type Interface Description interface
WeightedMatchingAlgorithm<V,E>
Deprecated.UseMatchingAlgorithm
directly -
Uses of MatchingAlgorithm in org.jgrapht.alg.matching
Classes in org.jgrapht.alg.matching that implement MatchingAlgorithm Modifier and Type Class Description class
EdmondsBlossomShrinking<V,E>
An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on graphs.class
GreedyWeightedMatching<V,E>
The greedy algorithm for computing a maximum weight matching in an arbitrary graph.class
HopcroftKarpBipartiteMatching<V,E>
This class is an implementation of the Hopcroft-Karp algorithm which finds a maximum matching in an undirected simple bipartite graph.class
KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E>
Kuhn-Munkres 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
MaximumWeightBipartiteMatching<V,E>
This class finds a maximum weight matching of a simple undirected weighted bipartite graph.class
PathGrowingWeightedMatching<V,E>
A linear time 1/2-approximation algorithm for finding a maximum weight matching in an arbitrary graph.
-