[코딩테스트 연습(Python)] 백준 1260번_DFS와 BFS

import sys
from collections import deque

input = sys.stdin.readline

n, m, v = map(int, input().split())

graph = [[] for _ in range(n + 1)]

visited_dfs = [False] * (n + 1)
visited_bfs = [False] * (n + 1)

for i in range(m):
    a, b = map(int, input().split())
    graph[a].append(b)
    graph[b].append(a)

for i in range(n+1):
    graph[i].sort()

def dfs(x):
    visited_dfs[x] = True
    print(x, end=" ")

    for i in graph[x]:
        if not visited_dfs[i]:
            dfs(i)


def bfs(x):
    visited_bfs[x] = True
    queue = deque()
    queue.append(x)

    while queue:
        pl = queue.popleft()
        print(pl, end=' ')
        
        for i in graph[pl]:
            if not visited_bfs[i]:
                queue.append(i)
                visited_bfs[i] = True    

dfs(v)
print()
bfs(v)