Skip to content

Corrected wrong DFS implementation #903

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

Merged
merged 1 commit into from
Jun 17, 2019
Merged

Corrected wrong DFS implementation #903

merged 1 commit into from
Jun 17, 2019

Conversation

ziyzhu
Copy link
Contributor

@ziyzhu ziyzhu commented Jun 15, 2019

explored set should not append the root/start outside of the while loop because the root/start is already in explored set and stack would be empty after the first pop. The "if v in explored" statement then triggers "continue" then it would exit the loop. As a result, this implementation would always return {'A'}.

Copy link
Member

@poyea poyea left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thank you for your pull request!🤩

@poyea poyea merged commit 55e0b0f into TheAlgorithms:master Jun 17, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants