Uses of Interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching (JGraphT : a free Java graph library)

Packages that use MatchingAlgorithm.Matching
Package	Description
org.jgrapht.alg.decomposition	Algorithms for computing decompositions.
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.matching	Algorithms for the computation of matchings.
org.jgrapht.alg.matching.blossom.v5	Package for Kolmogorov's Blossom V algorithm

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

Methods in org.jgrapht.alg.decomposition with parameters of type MatchingAlgorithm.Matching
Modifier and Type	Method	Description
`DulmageMendelsohnDecomposition.Decomposition<V,E>`	DulmageMendelsohnDecomposition.`decompose(MatchingAlgorithm.Matching<V,E> matching, boolean fine)`	Perform the decomposition, using a pre-calculated bipartite matching

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<V,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<V,E>`	MatchingAlgorithm.`getMatching()`	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<V,E>`	DenseEdmondsMaximumCardinalityMatching.`getMatching()`	Returns a matching of maximum cardinality.
`MatchingAlgorithm.Matching<V,E>`	GreedyMaximumCardinalityMatching.`getMatching()`	Get a matching that is a $\frac{1}{2}$-approximation of the maximum cardinality matching.
`MatchingAlgorithm.Matching<V,E>`	GreedyWeightedMatching.`getMatching()`	Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
`MatchingAlgorithm.Matching<V,E>`	HopcroftKarpMaximumCardinalityBipartiteMatching.`getMatching()`
`MatchingAlgorithm.Matching<V,E>`	KuhnMunkresMinimalWeightBipartitePerfectMatching.`getMatching()`	Compute a matching for a given graph.
`MatchingAlgorithm.Matching<V,E>`	MaximumWeightBipartiteMatching.`getMatching()`	Compute a matching for a given graph.
`MatchingAlgorithm.Matching<V,E>`	PathGrowingWeightedMatching.`getMatching()`	Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
`MatchingAlgorithm.Matching<V,E>`	SparseEdmondsMaximumCardinalityMatching.`getMatching()`

Methods in org.jgrapht.alg.matching with parameters of type MatchingAlgorithm.Matching
Modifier and Type	Method	Description
`boolean`	DenseEdmondsMaximumCardinalityMatching.`isMaximumMatching(MatchingAlgorithm.Matching<V,E> matching)`	Checks whether the given matching is of maximum cardinality.

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

Methods in org.jgrapht.alg.matching.blossom.v5 that return MatchingAlgorithm.Matching
Modifier and Type	Method	Description
`MatchingAlgorithm.Matching<V,E>`	KolmogorovWeightedMatching.`getMatching()`	Computes and returns a matching of maximum or minimum weight in the `initialGraph` depending on the goal of the algorithm.
`MatchingAlgorithm.Matching<V,E>`	KolmogorovWeightedPerfectMatching.`getMatching()`	Computes and returns a weighted perfect matching in the `graph`.