Feature Request: Implementation of the algorithms for finding maxium matching in a undirected graph #654
Description
Description
Graph algorithms should include algorithms which find the maximum matching of the given graph efficiently. Hopcroft-Karp is one such algorithm specifically for bipartite graphs
Expected Behaviour
- Implementation of algorithms which find the maximum matching of a Undirected Graph efficiently
- Provide an implementation of the Hopcroft-Karp algorithm with O(E√V) complexity.
- Support both adjacency list and adjacency matrix representations.
- Ensure the algorithm verifies bipartiteness before execution.
- Return the maximum matching set efficiently.