Module org.jgrapht.core
Package org.jgrapht.alg.interfaces

Interface MatchingAlgorithm<V,E>

Type Parameters:
V - the graph vertex type
E - the graph edge type
All Known Implementing Classes:
DenseEdmondsMaximumCardinalityMatching, GreedyMaximumCardinalityMatching, GreedyWeightedMatching, HopcroftKarpMaximumCardinalityBipartiteMatching, KolmogorovWeightedMatching, KolmogorovWeightedPerfectMatching, KuhnMunkresMinimalWeightBipartitePerfectMatching, MaximumWeightBipartiteMatching, PathGrowingWeightedMatching, SparseEdmondsMaximumCardinalityMatching
public interface MatchingAlgorithm<V,E>
Allows to derive a matching of a given graph.

  • Nested Class Summary

    Nested Classes
    Modifier and Type
    Interface
    Description
    static interface 
    MatchingAlgorithm.Matching<V,E>
    A graph matching.
    static class 
    MatchingAlgorithm.MatchingImpl<V,E>
    A default implementation of the matching interface.

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    static final double
    DEFAULT_EPSILON
    Default tolerance used by algorithms comparing floating point values.

  • Method Summary

    Modifier and Type
    Method
    Description
    MatchingAlgorithm.Matching<V,E>
    getMatching()
    Compute a matching for a given graph.

  • Field Details

    • DEFAULT_EPSILON

      static final double DEFAULT_EPSILON
      Default tolerance used by algorithms comparing floating point values.
      See Also:

  • Method Details