Add unit tests for graph algorithms (BFS, DFS, Dijkstra, Bellman-Ford…#7152
Closed
prashantdubeypng wants to merge 3 commits intoTheAlgorithms:masterfrom
Closed
Add unit tests for graph algorithms (BFS, DFS, Dijkstra, Bellman-Ford…#7152prashantdubeypng wants to merge 3 commits intoTheAlgorithms:masterfrom
prashantdubeypng wants to merge 3 commits intoTheAlgorithms:masterfrom
Conversation
…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
Codecov Report✅ All modified and coverable lines are covered by tests. 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. 🚀 New features to boost your workflow:
|
6 tasks
Member
|
@prashantdubeypng please check if the merge was correct and format your code if so please |
|
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.
…) #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