Update dfs_stack.py

dremdeveloper · Oct 2, 2023 · b01b1e7 · b01b1e7
1 parent a2414f7
commit b01b1e7
Showing 1 changed file with 2 additions and 1 deletion.
diff --git a/Algorithm_with_DataStructure/dfs_stack.py b/Algorithm_with_DataStructure/dfs_stack.py
@@ -25,15 +25,16 @@
 def dfs(graph, start_node):
     visited = [False] * (len(graph) + 1)
     stack = [start_node]
+    visited[start_node] = True;
 
     while stack:
         node = stack.pop()
-        visited[node] = True;
         print(node)
 
         for adj_node in graph[node]: # 인접한 노드 방문
            if not visited[adj_node]:
               stack.append(adj_node)
+                 visited[adj_node] = True;
 
 
 # 그래프를 인접 리스트로 표현