From 55e0b0f00a2dbfd46f47d06cd7bd564720738d16 Mon Sep 17 00:00:00 2001
From: zachzhu2016 <48337051+zachzhu2016@users.noreply.github.com>
Date: Mon, 17 Jun 2019 03:13:36 -0700
Subject: [PATCH] Corrected wrong DFS implementation (#903)

---
 graphs/DFS.py | 1 -
 1 file changed, 1 deletion(-)

diff --git a/graphs/DFS.py b/graphs/DFS.py
index c9843ca25..68bf60e3c 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