백준 1753번 def dijkstra(start): distance[start] = 0 heapq.heappush(heap, (0, start)) while heap: print(heap) current_distance, current_node = heapq.heappop(heap) if distance[current_node] < current_distance: continue for d, n in graph[current_node]: next_distance = d + current_distance if next_distance < distance[n]: distance[n] = next_distance heapq.heappush(heap, (next_distance, n))