-
Notifications
You must be signed in to change notification settings - Fork 20.9k
Implement Bidirectional BFS algorithm #7146
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
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 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