코드 import sys, heapq input = sys.stdin.readline INF = 987654321 n,m = map(int, input().split()) graph = [[] for _ in range(n+1)] visited = [INF]*(n+1) # 양방향 그래프를 만들어 준다. for _ in range(m): a,b,c = map(int, input().split()) graph[a].append((b,c)) graph[b].append((a,c)) def dijkstra(start): queue = [(0, start)] visited[start] = 0 while queue: now, next = heapq.heappop(queue) if now > visited[next]..
