[BOJ]최단 경로 / 골드 5 / 45분

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

Author: YoonYn9915

YoonYn9915/dijkstra/2025-06-28-[백준]-#1753-최단 경로.py

@@ -0,0 +1,41 @@
+import heapq
+import sys
+
+input = sys.stdin.readline
+
+V, E = map(int, input().split())
+start = int(input())
+graph = [[] for _ in range(V + 1)]
+
+for _ in range(E):
+    u, v, w = map(int, input().split())
+
+    graph[u].append((v, w))
+
+
+def dijkstra(start):
+    distances = [float("inf")] * (V + 1)
+    distances[start] = 0
+    q = []
+    heapq.heappush(q, (distances[start], start))
+
+    while q:
+        cnt_distance, node = heapq.heappop(q)
+
+        if distances[node] < cnt_distance:
+            continue
+
+        for adjacency_node, distance in graph[node]:
+            cal_distance = distances[node] + distance
+
+            if cal_distance < distances[adjacency_node]:
+                distances[adjacency_node] = cal_distance
+                heapq.heappush(q, (cal_distance, adjacency_node))
+
+    return distances
+
+
+result = dijkstra(start)
+
+for i in range(1, len(result)):
+    print("INF" if result[i] == float("inf") else result[i])