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

Packages that use MatchingAlgo

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 MatchingAlgo in com.jgalgo.alg.match

Classes in com.jgalgo.alg.match that implement MatchingAlgo

Modifier and Type	Class	Description
class	MatchingAlgoAbstract	Abstract class for computing matchings in graphs.
class	MatchingAlgoAbstractBasedMaximum	Abstract class for computing matching in graphs, based on a maximum matching solution.
class	MatchingAlgoAbstractBasedMinimum	Abstract class for computing matching in graphs, based on a minimum matching solution.
class	MatchingAlgoAbstractCardinality	Abstract class for computing (only) cardinality matching in a graph.
class	MatchingCardinalityBipartiteHopcroftKarp	Hopcroft–Karp maximum unweighted matching algorithm for undirected bipartite graphs.
class	MatchingCardinalityGabow1976	Gabow's implementation of Endmond's algorithm for cardinality maximum matching in general graphs.
class	MatchingWeightedBipartiteHungarianMethod	Kuhn's Hungarian method for maximum weighted matching in bipartite graphs.
class	MatchingWeightedBipartiteSssp	Maximum weighted matching algorithm using ShortestPathSingleSource for bipartite graphs.
class	MatchingWeightedBlossomV	Blossom V implementation for maximum weighted matching.
class	MatchingWeightedGabow1990	Edmonds' Blossom algorithm for Maximum weighted matching with Gabow's dynamic LCA data structure.
class	MatchingWeightedGabow1990Simpler	Edmonds' Blossom algorithm for Maximum weighted matching with Gabow's implementation WITHOUT dynamic LCA data structure.

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

Modifier and Type	Method	Description
MatchingAlgo	MatchingAlgo.Builder.build()	Create a new matching algorithm object.
static MatchingAlgo	MatchingAlgo.newInstance()	Create a new matching algorithm object.