알고리즘 수업 - 깊이 우선 탐색 2

https://www.acmicpc.net/problem/24480

24480번: 알고리즘 수업 - 깊이 우선 탐색 2

import sys
sys.setrecursionlimit(10**6)
n, m, r = map(int, sys.stdin.readline().split())

graph = [[] for _ in range(n + 1)]
cnt = 1
visited = [False] * (n + 1)
ans = [0] * (n + 1)
for _ in range(m):
    a, b = map(int, sys.stdin.readline().split())
    graph[a].append(b)
    graph[b].append(a)


def dfs(n):
    global cnt
    visited[n] = True
    ans[n] = cnt
    cnt += 1
    graph[n].sort(reverse=True)
    for idx in graph[n]:
        if visited[idx] is False:
            dfs(idx)


dfs(r)

for i in range(1, n + 1):
    print(ans[i])