Implement Bidirectional BFS algorithm#7146
Closed
darkatwi wants to merge 12 commits intoTheAlgorithms:masterfrom
Closed
Implement Bidirectional BFS algorithm#7146darkatwi wants to merge 12 commits intoTheAlgorithms:masterfrom
darkatwi wants to merge 12 commits intoTheAlgorithms:masterfrom
Conversation
This class implements the Bidirectional Breadth-First Search (BFS) algorithm to determine if a path exists between two nodes in an unweighted graph. It explores the graph from both the start and goal nodes simultaneously, improving efficiency for large graphs.
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #7146 +/- ##
============================================
- Coverage 78.56% 78.47% -0.10%
- Complexity 6794 6795 +1
============================================
Files 762 763 +1
Lines 22520 22548 +28
Branches 4429 4436 +7
============================================
+ Hits 17693 17694 +1
- Misses 4115 4143 +28
+ Partials 712 711 -1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Updated the Bidirectional BFS implementation to improve code clarity and structure.
This test verifies the functionality of the BidirectionalBFS algorithm by checking for paths in a sample graph.
…orithms/datastructures/graphs/BidirectionalBFSTest.java
Added unit tests for BidirectionalBFS to check path existence.
…ionalBFSTest.java
|
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
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.
This class implements the Bidirectional Breadth-First Search (BFS) algorithm to determine if a path exists between two nodes in an unweighted graph. It explores the graph from both the start and goal nodes simultaneously, improving efficiency for large graphs.
clang-format -i --style=file path/to/your/file.java