## The Hopcroft-Karp Algorithm – GT – Computability, Complexity, Theory: Algorithms

Articles, Blog 2 CommentsThe Hopcroft-Karp algorithm goes like this. We first initialize the matching to the empty set, then we repeat the following. First, we build an alternating level graph rooted at the unmatched vertices on the left part of the partition using breadth-first search. Let’s pause for a moment here and see how this works in an