Uses of Interface
org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching

Packages that use MatchingAlgorithm.Matching

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.Matching in org.jgrapht.alg

Methods in org.jgrapht.alg that return MatchingAlgorithm.Matching

Modifier and Type	Method	Description
MatchingAlgorithm.Matching<E>	EdmondsBlossomShrinking.computeMatching()	Deprecated. Compute a matching for a given graph.
MatchingAlgorithm.Matching<E>	HopcroftKarpBipartiteMatching.computeMatching()	Deprecated. Compute a matching for a given graph.
MatchingAlgorithm.Matching<E>	KuhnMunkresMinimalWeightBipartitePerfectMatching.computeMatching()	Deprecated. Compute a matching for a given graph.
MatchingAlgorithm.Matching<E>	MaximumWeightBipartiteMatching.computeMatching()	Deprecated. Compute a matching for a given graph.

Uses of MatchingAlgorithm.Matching in org.jgrapht.alg.interfaces

Classes in org.jgrapht.alg.interfaces that implement MatchingAlgorithm.Matching

Modifier and Type	Class	Description
static class	MatchingAlgorithm.MatchingImpl<E>	A default implementation of the matching interface.

Methods in org.jgrapht.alg.interfaces that return MatchingAlgorithm.Matching

Modifier and Type	Method	Description
MatchingAlgorithm.Matching<E>	MatchingAlgorithm.computeMatching()	Compute a matching for a given graph.

Uses of MatchingAlgorithm.Matching in org.jgrapht.alg.matching

Methods in org.jgrapht.alg.matching that return MatchingAlgorithm.Matching

Modifier and Type	Method	Description
MatchingAlgorithm.Matching<E>	EdmondsBlossomShrinking.computeMatching()	Compute a matching for a given graph.
MatchingAlgorithm.Matching<E>	GreedyWeightedMatching.computeMatching()	Get a matching that is a 1/2-approximation of the maximum weighted matching.
MatchingAlgorithm.Matching<E>	HopcroftKarpBipartiteMatching.computeMatching()	Compute a matching for a given graph.
MatchingAlgorithm.Matching<E>	KuhnMunkresMinimalWeightBipartitePerfectMatching.computeMatching()	Compute a matching for a given graph.
MatchingAlgorithm.Matching<E>	MaximumWeightBipartiteMatching.computeMatching()	Compute a matching for a given graph.
MatchingAlgorithm.Matching<E>	PathGrowingWeightedMatching.computeMatching()	Get a matching that is a 1/2-approximation of the maximum weighted matching.
private MatchingAlgorithm.Matching<E>	PathGrowingWeightedMatching.run()
private MatchingAlgorithm.Matching<E>	PathGrowingWeightedMatching.runWithHeuristics()