Added Bipartite Algorithm #646
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
References to other Issues or PRs or Relevant literature
Fixes #645
Brief description of what is fixed or changed
This PR introduces the implementation of a bipartite-check algorithm.
Added the is_bipartite function in pydatastructs/graphs/algorithms.py to determine whether an undirected graph is bipartite using a BFS-based approach. The algorithm runs in O(V + E) time and returns a tuple containing a boolean indicating bipartiteness and a dictionary mapping vertices to their assigned colors.
Updated the documentation with an example usage snippet, and relevant reference link.
Updated the all list to expose is_bipartite as part of the public API.
Added the test cases for the bipartite-check algorithm.
Other comments