알고리즘 수업 - 너비 우선 탐색 1

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

24444번: 알고리즘 수업 - 너비 우선 탐색 1

from collections import deque
import sys
n, m, r = map(int, sys.stdin.readline().split())

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

def bfs(num):
    cnt = 1
    q = deque()
    visited = [False] * (n + 1)
    q.append(num)
    ans = [0] * (n + 1)
    while q:
        curr_node = q.popleft()
        visited[curr_node] = True
        ans[curr_node] = cnt
        cnt += 1
        graph[curr_node].sort()
        for i in graph[curr_node]:
            if visited[i] is False:
                visited[i] = True
                q.append(i)
    return ans

ans = bfs(r)

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