Package org.graph4j.matching

Interface MatchingAlgorithm

All Known Implementing Classes:
GreedyWeightedMatching, HopcroftKarpMaximumMatching, MaximalCardinalityMatching
public interface MatchingAlgorithm
The contract for matching algorithms. A matching is a subset of independent edges (no two edges are incident).
Author:
Cristian Frăsinaru

  • Method Details

    • getGraph

      Graph getGraph()
      Returns:
      the input graph.

    • getMatching

      Matching getMatching()
      Returns:
      a matching for the input graph;