Package com.jgalgo.alg.match

Algorithms for computing matchings in graphs, such as maximum/minimum weight matchings, maximum cardinality matchings, perfect matchings, ect.

Interface Summary

Interface	Description
IMatching	A matching in a IntGraph.
Matching<V,E>	A matching in a graph.
MatchingAlgo	Maximum/minimum matching algorithm.
MatchingAlgo.Builder	A builder for MatchingAlgo objects.

Class Summary

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