-
Notifications
You must be signed in to change notification settings - Fork 20.9k
Add unit tests for graph algorithms (BFS, DFS, Dijkstra, Bellman-Ford... #7152
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
Open
prashantdubeypng
wants to merge
2
commits into
TheAlgorithms:master
from
prashantdubeypng:fix/issue-7133-graph-algorithm-tests
Open
Add unit tests for graph algorithms (BFS, DFS, Dijkstra, Bellman-Ford... #7152
prashantdubeypng
wants to merge
2
commits into
TheAlgorithms:master
from
prashantdubeypng:fix/issue-7133-graph-algorithm-tests
Conversation
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
...TheAlgorithms#7133 - Created BellmanFordTest.java with 10 test methods covering various graph scenarios - Created ConnectedComponentTest.java with 15 test methods for DFS-based component counting - Enhanced MatrixGraphsTest.java with additional BFS/DFS test cases - Enhanced DijkstraAlgorithmTest.java with comprehensive shortest path tests Fixes TheAlgorithms#7133
@prashantdubeypng
prashantdubeypng
requested review from
DenizAltunkapan,
alxkm and
yanglbme
as code owners
December 8, 2025 06:50
codecov-commenter
commented
Dec 8, 2025
Codecov Report
✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 78.87%. Comparing base (316def4) to head (3fe62da).
Additional details and impacted files
@@ Coverage Diff @@ ## master #7152 +/- ## ============================================ + Coverage 78.62% 78.87% +0.25% - Complexity 6825 6828 +3 ============================================ Files 766 766 Lines 22607 22607 Branches 4444 4444 ============================================ + Hits 17774 17831 +57 + Misses 4119 4064 -55 + Partials 714 712 -2
☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.
🚀 New features to boost your workflow:
- ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.
6 tasks
...mponent, BellmanFord
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.
Uh oh!
There was an error while loading. Please reload this page.
...) #7133
Created BellmanFordTest.java with 10 test methods covering various graph scenarios
Created ConnectedComponentTest.java with 15 test methods for DFS-based component counting
Enhanced MatrixGraphsTest.java with additional BFS/DFS test cases
Enhanced DijkstraAlgorithmTest.java with comprehensive shortest path tests
Fixes #7133
clang-format -i --style=file path/to/your/file.java