백준 | DFS와 BFS

백준 DFS와 BFS

import sys
from collections import deque

def dfs(node):
    visited[node] = True
    print(node, end=" ")

    for next_node in graph[node]:
        if not visited[next_node]:
            dfs(next_node)

def bfs(node):
    queue = deque([node])
    visited[node] = True

    while queue:
        current_node = queue.popleft()
        print(current_node, end=" ")

        for next_node in graph[current_node]:
            if not visited[next_node]:
                queue.append(next_node)
                visited[next_node] = True

# 입력
n, m, v = map(int, sys.stdin.readline().split())

graph = [[] for _ in range(n + 1)]
for _ in range(m):
    x, y = map(int, sys.stdin.readline().split())

    graph[x].append(y)
    graph[y].append(x)

# 정점 번호 오름차순 정렬
for i in range(1, n + 1):
    graph[i].sort()

# 출력
visited = [False] * (n + 1)
dfs(v)

print()

visited = [False] * (n + 1)
bfs(v)