Add Bipartite Graph Check algorithm#576
Merged
siriak merged 4 commits intoTheAlgorithms:masterfrom Nov 14, 2025
Merged
Conversation
Checks if a graph can be 2-colored (bipartite). A bipartite graph has vertices divisible into two independent sets. Features: - IsBipartite() - BFS-based check - IsBipartiteDfs() - DFS-based check - GetPartitions() - Returns the two sets - O(V + E) time complexity - Works with disconnected graphs Tests (20 test cases): - Empty, single, and two-vertex graphs - Triangles (odd cycles) and squares (even cycles) - Complete bipartite graphs K(m,n) - Disconnected components - Star graphs and pentagons - Large even/odd cycles - Edge cases and validation Use Cases: - Job assignment problems - Network flow modeling - Conflict detection - Graph coloring problems Files: - Algorithms/Graph/BipartiteGraph.cs (234 lines) - Algorithms.Tests/Graph/BipartiteGraphTests.cs (407 lines)
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #576 +/- ##
==========================================
+ Coverage 96.93% 96.95% +0.01%
==========================================
Files 298 299 +1
Lines 12402 12527 +125
Branches 1804 1832 +28
==========================================
+ Hits 12022 12145 +123
- Misses 240 242 +2
Partials 140 140 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Replace if-else blocks with ternary operators for cleaner code
Add validation tests for GetPartitions and IsBipartiteDfs methods
Contributor
Author
|
@siriak Please check this PR as well, Thanks. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Summary
Adds Bipartite Graph Check algorithm to determine if a graph can be 2-colored.
Algorithm
A bipartite graph can be divided into two independent sets where no two vertices within the same set are adjacent. Uses BFS/DFS coloring approach.
Features
IsBipartite()- BFS-based checkIsBipartiteDfs()- DFS-based checkGetPartitions()- Returns the two setsTests (20 cases)
Use Cases
Files
Algorithms/Graph/BipartiteGraph.cs(233 lines)Algorithms.Tests/Graph/BipartiteGraphTests.cs(425 lines)Contribution by Gittensor, learn more at https://gittensor.io/