Create BFS_DFS_류지예.py

4주차/1)BFS_DFS/BFS_DFS_류지예.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)
+
+