feat: add Depth first search #2815
Open
Conversation
This file contains 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
adi776borate
requested review from
Panquesito7 and
realstealthninja
as code owners
realstealthninja
changed the title
realstealthninja
requested changes
Oct 15, 2024
|
I've updated the algorithm and added more test cases as per the feedback received. Please review the latest changes. Thank you! |
realstealthninja
requested changes
Oct 19, 2024
realstealthninja
requested changes
Oct 21, 2024
| }; | ||
| std::uint32_t n3 = 5, u3 = 0, v3 = 4; | ||
| assert(graph::count_paths(graph3, u3, v3, n3) == 3); // There are 3 paths from node 0 to 4 | ||
|
|
There was a problem hiding this comment.
add a test case for empty array
std::vector<std::vectorstd::uint32_t> graph5 = {{}};
this should return 0 as there is no path
There was a problem hiding this comment.
I've made the latest changes as per your feedback. I hope this meets the requirements now. Looking forward to your review.
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.
Description of Change
Checklist
Notes: The new function counts the number of unique paths between two nodes in a graph. It can be particularly useful in graph-related problems where pathfinding is necessary.