 Hopcroft–Karp algorithm

The Hopcroft–Karp algorithm is a classic algorithm used to find the maximum matching in a bipartite graph. A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other set. The algorithm works in two main phases: 1. **BFS Phase**: It performs a breadth-first search (BFS) to find the shortest augmenting paths.