mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Corrected wrong DFS implementation (#903)

Browse Source
This commit is contained in:
zachzhu2016 2019-06-17 03:13:36 -07:00 committed by John Law
parent 6e2fb22f5e
commit 55e0b0f00a
1 changed files with 0 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
graphs/DFS.py
View File

@ -16,7 +16,6 @@ def dfs(graph, start):
to the node's children onto the iterator stack. When the iterator at the top of the stack terminates, we'll pop to the node's children onto the iterator stack. When the iterator at the top of the stack terminates, we'll pop
it off the stack.""" it off the stack."""
explored, stack = set(), [start] explored, stack = set(), [start]
explored.add(start)
while stack: while stack:
v = stack.pop() # one difference from BFS is to pop last element here instead of first one v = stack.pop() # one difference from BFS is to pop last element here instead of first one