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

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

24479번: 알고리즘 수업 - 깊이 우선 탐색 1

import sys
sys.setrecursionlimit(10 ** 9)

n, m, r = map(int, sys.stdin.readline().split())
graph = [[] for i in range(n + 1)]

for _ in range(m):
    u, v = map(int, sys.stdin.readline().split())
    graph[u].append(v)
    graph[v].append(u)

visited = [0] * (n + 1)
ans = [0] * (n + 1)
cnt = 1

def dfs(r):
    global cnt
    visited[r] = 1
    ans[r] = cnt
    cnt += 1
    graph[r].sort()
    for k in graph[r]:
        if visited[k] == 0:
            dfs(k)


dfs(r)

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