Feature Request: Bipartite Matching for Undirected Graph

[Akshat-Shu]

Description
The library currently does not provide a built-in implementation for bipartite matching in undirected graphs. Adding support for this would enhance the library’s functionality for graph-based algorithms.

Expected Behaviour

• a self-sufficient implementation which checks if the graph is bipartite and returns a valid coloring if so
• Could also be used a helper function for algorithms which might require bipartite validation for the input graph