From b84e1858c63e5156db7b490a4cc3f21f6b17909a Mon Sep 17 00:00:00 2001
From: Jiye Ryu <70010181+ryeya@users.noreply.github.com>
Date: Tue, 17 Jan 2023 12:23:25 +0900
Subject: [PATCH] =?UTF-8?q?Create=20BFS=5FDFS=5F=EB=A5=98=EC=A7=80?=
 =?UTF-8?q?=EC=98=88.py?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...S_\353\245\230\354\247\200\354\230\210.py" | 44 +++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 "4\354\243\274\354\260\250/1)BFS_DFS/BFS_DFS_\353\245\230\354\247\200\354\230\210.py"

diff --git "a/4\354\243\274\354\260\250/1)BFS_DFS/BFS_DFS_\353\245\230\354\247\200\354\230\210.py" "b/4\354\243\274\354\260\250/1)BFS_DFS/BFS_DFS_\353\245\230\354\247\200\354\230\210.py"
new file mode 100644
index 0000000..a41de37
--- /dev/null
+++ "b/4\354\243\274\354\260\250/1)BFS_DFS/BFS_DFS_\353\245\230\354\247\200\354\230\210.py"
@@ -0,0 +1,44 @@
+from collections import deque
+
+
+def dfs(v):
+    visited[v] = True
+    print(v, end=" ")
+
+    for i in graph[v]:
+        if not visited[i]:
+            dfs(i)
+
+
+def bfs(v):
+    queue = deque([v])
+    visited[v] = True
+    while queue:
+
+        v = queue.popleft()
+        print(v, end=" ")
+        for i in graph[v]:
+            if not visited[i]:
+                visited[i] = True
+                queue.append(i)
+
+
+n, m, v = map(int, input().split())
+graph = [[] for _ in range(n + 1)]
+
+for _ in range(m):
+    a, b = map(int, input().split())
+    graph[a].append(b)
+    graph[b].append(a)
+
+for i in graph:
+    i.sort()
+
+visited = [False] * (n + 1)
+dfs(v)
+print()
+
+visited = [False] * (n + 1)
+bfs(v)
+
+