⚙️AlgorithmIntermediate
Bipartite Matching - Hopcroft-Karp
Hopcroft–Karp computes maximum matching in a bipartite graph in O(E \sqrt{V}) time, which is asymptotically faster than repeated DFS (Kuhn's algorithm).
#hopcroft karp#bipartite matching#augmenting path+11