[백준-1753] 최단경로 / Python

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

1753번: 최단경로

import sys
import heapq

INF = int(1e9)
V, E = map(int, sys.stdin.readline().split())
k = int(sys.stdin.readline())
graph = [[] for _ in range(V + 1)]
distance = [INF] * (V + E)

for _ in range(E):
    u, v, w = map(int, input().split())
    graph[u].append((v, w))


def dijkstra(start):
    q = []
    heapq.heappush(q, (0, start))
    distance[start] = 0
    while q:
        dist, now = heapq.heappop(q)
        if distance[now] < dist:
            continue
        for i in graph[now]:
            cost = dist + i[1]
            if cost < distance[i[0]]:
                distance[i[0]] = cost
                heapq.heappush(q, (cost, i[0]))


dijkstra(k)
for i in range(1, V + 1):
    if distance[i] == INF:
        print("INF")
    else:
        print(distance[i])

 

해설

어제 이취코 책에서 복습했던 다익스트라 문제와 같다. 어제 복습한 덕분에 수월하게 해결했다 !😀