feat: add algorithm to find the number of paths in a graph using DFS#2815
Merged
realstealthninja merged 16 commits intoTheAlgorithms:masterfrom Aug 17, 2025
Merged
Conversation
realstealthninja
requested changes
Oct 15, 2024
Contributor
Author
|
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
anandfresh
approved these changes
Aug 1, 2025
realstealthninja
approved these changes
Aug 16, 2025
realstealthninja
approved these changes
Aug 17, 2025
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.
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.