Add bipartite graph algo using DFS#6761
Closed
Ilmakram wants to merge 3 commits intoTheAlgorithms:masterfrom
Closed
Add bipartite graph algo using DFS#6761Ilmakram wants to merge 3 commits intoTheAlgorithms:masterfrom
Ilmakram wants to merge 3 commits intoTheAlgorithms:masterfrom
Conversation
Ilmakram
requested review from
DenizAltunkapan,
alxkm and
yanglbme
as code owners
Member
|
@Ilmakram Please fix the failing workflows so I can start the review. |
|
This pull request has been automatically closed because its workflows or checks failed and it has been inactive for more than 14 days. Please fix the workflows and reopen if you'd like to continue. Merging from main/master alone does not count as activity. |
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.
Added a Java implementation to check whether a graph is bipartite using DFS.
The program supports user input, handles disconnected graphs, and includes detailed JavaDocs.
Tested with sample graphs to ensure correctness.