The Hopcroft-Karp algorithm Finds the Maximum Matching in a Bipartite Graph, A Graph whose Vertices can be Separated into Two Disjoint Sets, with Every Edge Connecting Vertices between These sets and None Within a Set. The goal is to Select as Many Edges as Possible so that No Two Edges Share a Vertex