Class MatchingCardinalityBipartiteHopcroftKarp

  • All Implemented Interfaces:
    MatchingAlgo

    public class MatchingCardinalityBipartiteHopcroftKarp
    extends MatchingAlgoAbstractCardinality
    Hopcroft–Karp maximum unweighted matching algorithm for undirected bipartite graphs.

    The algorithm runs in \(O(m \sqrt{n})\) and it uses linear space.

    Based on "A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs" by J. Hopcroft and R. Karp (1973).

    Author:
    Barak Ugav
    See Also:
    Wikipedia
    • Constructor Detail

      • MatchingCardinalityBipartiteHopcroftKarp

        public MatchingCardinalityBipartiteHopcroftKarp()
        Create a new maximum matching object.