Class MatchingAlgoAbstractBasedMinimum

  • All Implemented Interfaces:
    MatchingAlgo
    Direct Known Subclasses:
    MatchingWeightedBlossomV

    public abstract class MatchingAlgoAbstractBasedMinimum
    extends MatchingAlgoAbstract
    Abstract class for computing matching in graphs, based on a minimum 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 minimum matching problem, MatchingAlgoAbstract.computeMinimumWeightedMatching(IndexGraph, IWeightFunction) and MatchingAlgoAbstract.computeMinimumWeightedPerfectMatching(IndexGraph, IWeightFunction), which is left to the subclasses to implement.

    Author:
    Barak Ugav
    • Constructor Detail

      • MatchingAlgoAbstractBasedMinimum

        public MatchingAlgoAbstractBasedMinimum()
        Default constructor.