Implemented Iterative DFS #45
Closed
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
|
You don't mark the nodes as visited when they are inserted in stack, they are marked visited when they are popped out of stack |
|
Are you working on this issue? If yes, then complete it by tomorrow |
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.
Title: Added implementation for Iterative DFS in Java, C++, Python
Issue Link:
Fixes #43
Changes Made:
DFS_Iterative/containing:dfs_iter.java(Java implementation for prefix sum)dfs_iter.cpp(C++ implementation for prefix sum)dfs_iter.py(Python implementation for prefix sum)README.md(Documentation for theDFS_Iterativefolder explaining the implementation)RoadMap.mdto include a hyperlink to the DFS_Iterative/ folder and checked the relevant box for it.Checklist:
RoadMap.mdwith a checkbox and hyperlink to DFS_Iterative/.