Uses of Interface
com.jgalgo.alg.match.Matching

Packages that use Matching

Package	Description
com.jgalgo.alg.match	Algorithms for computing matchings in graphs, such as maximum/minimum weight matchings, maximum cardinality matchings, perfect matchings, ect.

Uses of Matching in com.jgalgo.alg.match

Subinterfaces of Matching in com.jgalgo.alg.match

Modifier and Type	Interface	Description
interface	IMatching	A matching in a IntGraph.

Methods in com.jgalgo.alg.match that return Matching

Modifier and Type	Method	Description
<V, E> Matching<V,E>	MatchingAlgo.computeMaximumMatching(Graph<V,E> g, WeightFunction<E> w)	Compute the maximum weighted matching of a weighted undirected graph.
<V, E> Matching<V,E>	MatchingAlgoAbstract.computeMaximumMatching(Graph<V,E> g, WeightFunction<E> w)
<V, E> Matching<V,E>	MatchingAlgo.computeMaximumPerfectMatching(Graph<V,E> g, WeightFunction<E> w)	Compute the maximum perfect matching of a weighted undirected graph.
<V, E> Matching<V,E>	MatchingAlgoAbstract.computeMaximumPerfectMatching(Graph<V,E> g, WeightFunction<E> w)
<V, E> Matching<V,E>	MatchingAlgo.computeMinimumMatching(Graph<V,E> g, WeightFunction<E> w)	Compute the minimum weighted matching of a weighted undirected graph.
<V, E> Matching<V,E>	MatchingAlgoAbstract.computeMinimumMatching(Graph<V,E> g, WeightFunction<E> w)
<V, E> Matching<V,E>	MatchingAlgo.computeMinimumPerfectMatching(Graph<V,E> g, WeightFunction<E> w)	Compute the minimum perfect matching of a weighted undirected graph.
<V, E> Matching<V,E>	MatchingAlgoAbstract.computeMinimumPerfectMatching(Graph<V,E> g, WeightFunction<E> w)