[파이썬] 24446 알고리즘 수업 - 너비 우선 탐색 3

from collections import deque
import sys
input = sys.stdin.readline

n, m, r = map(int, input().split())
graph = [[] for _ in range(n + 1)]
visited = [-1] * (n + 1)

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

def bfs(v):
    q = deque([r])
    visited[r] = 0
    while q:
        v = q.popleft()
        for g in graph[v]:
            if visited[g] == -1:
                visited[g] = visited[v] + 1
                q.append(g)
bfs(r)

for v in visited[1:]:
    print(v)

bfs