1. 문제 2. 풀이 과정 방법 1) heapq 이용, 방법 2)를 추천 import heapq as hq def solution(n, edge): answer = 0 graph = [[] for _ in range(n+1)] distance = [int(1e9)]*(n+1) for x, y in edge: graph[x].append(y) graph[y].append(x) q = [] hq.heappush(q, (0, 1)) #최소거리, 시작노드 번호 distance[1] = 0 while q: d, node = hq.heappop(q) for n in graph[node]: if distance[n] == int(1e9): #방문하지 않은 노드라면 hq.heappush(q, (d+1, n)) dist..
