7-froglike6

froglike6/README.md

@@ -8,4 +8,5 @@
  | 4차시 | 2025.03.30 | 그래프 | [친구](https://www.acmicpc.net/problem/1058)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/16|
  | 5차시 | 2025.04.01 |  정수  | [개구리](https://www.acmicpc.net/problem/25333)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/17|
  | 6차시 | 2025.04.07 | 백트래킹| [N-Queen](https://www.acmicpc.net/problem/9663)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/24|
+ | 7차시 | 2025.04.09 | 그래프 | [최소비용 구하기](https://www.acmicpc.net/problem/1916)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/27|
  ---

froglike6/graph_theory/1916.py

@@ -0,0 +1,30 @@
+import sys
+import heapq
+
+def dijkstra(n, graph, start):
+    INF = float('inf')
+    distances = [INF] * (n + 1)
+    distances[start] = 0
+    queue = [(0, start)]
+
+    while queue:
+        current_cost, current_node = heapq.heappop(queue)
+        if current_cost > distances[current_node]:
+            continue
+        for next_node, weight in graph[current_node]:
+            cost = current_cost + weight
+            if cost < distances[next_node]:
+                distances[next_node] = cost
+                heapq.heappush(queue, (cost, next_node))
+    return distances
+
+input = sys.stdin.readline
+N = int(input())
+M = int(input())
+graph = [[] for _ in range(N+1)]
+for _ in range(M):
+    u, v, w = map(int, input().split())
+    graph[u].append((v, w))
+start, end = map(int, input().split())
+distances = dijkstra(N, graph, start)
+print(distances[end])