Package com.jgalgo.alg.match
Class MatchingAlgoAbstractCardinality
java.lang.Object
com.jgalgo.alg.match.MatchingAlgoAbstract
com.jgalgo.alg.match.MatchingAlgoAbstractCardinality
- All Implemented Interfaces:
MatchingAlgo
- Direct Known Subclasses:
MatchingCardinalityBipartiteHopcroftKarp
,MatchingCardinalityGabow1976
Abstract class for computing (only) cardinality matching in a graph.
The MatchingAlgo
interface expose a large number of methods of different variants of the matching problem.
This abstract class implements these methods by restricting the input weight function to be the
cardinality weight function or null
, and solving only
a relatively simply maximum cardinality matching, computeMaximumCardinalityMatching(IndexGraph)
, which is
left to the subclasses to implement.
- Author:
- Barak Ugav
-
Nested Class Summary
Nested classes/interfaces inherited from interface com.jgalgo.alg.match.MatchingAlgo
MatchingAlgo.Builder
-
Constructor Summary
-
Method Summary
Methods inherited from class com.jgalgo.alg.match.MatchingAlgoAbstract
computeMaximumMatching, computeMaximumPerfectMatching, computeMinimumMatching, computeMinimumPerfectMatching
-
Constructor Details
-
MatchingAlgoAbstractCardinality
public MatchingAlgoAbstractCardinality()Default constructor.
-