From 0377164732f54b7d6144ea3eb05092f6cce00146 Mon Sep 17 00:00:00 2001 From: Zachary Zhu Date: Sat, 15 Jun 2019 16:53:15 -0700 Subject: [PATCH] Corrected wrong DFS implementation --- graphs/DFS.py | 1 - 1 file changed, 1 deletion(-) diff --git a/graphs/DFS.py b/graphs/DFS.py index c9843ca25382..68bf60e3c298 100644 --- a/graphs/DFS.py +++ b/graphs/DFS.py @@ -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 it off the stack.""" explored, stack = set(), [start] - explored.add(start) while stack: v = stack.pop() # one difference from BFS is to pop last element here instead of first one