Implement Hopcroft-karp algorithm to find the maximum matching

[Akshat-Shu]

References to other Issues or PRs or Relevant literature

Fixes #654
Fixes #653
Works upon #652

Brief description of what is fixed or changed

• Implemented an algorithm to determine if a graph is bipartite by finding a valid bipartite coloring.
• Implemented the Hopcroft-Karp algorithm to compute the maximum matching in a bipartite graph.
• Added input validation to ensure the graph is bipartite before executing the matching algorithm.
• Provided both sequential and parallel implementations for improved performance.
• Added unit tests to verify bipartiteness checking and the correctness of the maximum matching algorithm.