Package com.jgalgo.alg.match
Class MatchingAlgoAbstractBasedMaximum
- java.lang.Object
-
- com.jgalgo.alg.match.MatchingAlgoAbstract
-
- com.jgalgo.alg.match.MatchingAlgoAbstractBasedMaximum
-
- All Implemented Interfaces:
MatchingAlgo
- Direct Known Subclasses:
MatchingWeightedBipartiteHungarianMethod
,MatchingWeightedBipartiteSssp
,MatchingWeightedGabow1990
,MatchingWeightedGabow1990Simpler
public abstract class MatchingAlgoAbstractBasedMaximum extends MatchingAlgoAbstract
Abstract class for computing matching in graphs, based on a maximum matching solution.The
MatchingAlgo
interface expose a large number of methods of different variants of the matching problem. This abstract class implements some of these methods by reducing to a maximum matching problem,MatchingAlgoAbstract.computeMaximumWeightedMatching(IndexGraph, IWeightFunction)
andMatchingAlgoAbstract.computeMaximumWeightedPerfectMatching(IndexGraph, IWeightFunction)
, 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
Constructors Constructor Description MatchingAlgoAbstractBasedMaximum()
Default constructor.
-
Method Summary
-
Methods inherited from class com.jgalgo.alg.match.MatchingAlgoAbstract
computeMaximumMatching, computeMaximumPerfectMatching, computeMinimumMatching, computeMinimumPerfectMatching
-
-