0726

djs02027 · djs02027 · commit e86fd152dba5 · 2022-07-06T12:21:38.000+09:00
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/solve.ac/class 4/1504_특정한 최단 경로/1504_특정한 최단 경로.py b/solve.ac/class 4/1504_특정한 최단 경로/1504_특정한 최단 경로.py
@@ -9,7 +9,7 @@
 INF = int(1e9)
 
 
-def dikjestra(start):
+def dikjstra(start):
     distance = [INF] * (N + 1)
     distance[start] = 0
     heap = []
@@ -33,7 +33,7 @@ def dikjestra(start):
     grape[e].append((s, v))
 u, v = map(int, input().split())
 
-root = dikjestra(1)[u] + dikjestra(u)[v] + dikjestra(v)[N]
-backroot = dikjestra(1)[v] + dikjestra(v)[u] + dikjestra(u)[N]
+root = dikjstra(1)[u] + dikjstra(u)[v] + dikjstra(v)[N]
+backroot = dikjstra(1)[v] + dikjstra(v)[u] + dikjstra(u)[N]
 result = min(root, backroot)
 print(-1 if INF <= result else result)
diff --git a/solve.ac/class 4/1753_최단경로/1753_최단경로.py b/solve.ac/class 4/1753_최단경로/1753_최단경로.py
@@ -0,0 +1,31 @@
+import heapq
+
+INF = int(1e9)
+
+
+def dikjstra(start):
+    distance = [INF] * (V + 1)
+    distance[start] = 0
+    heap = []
+    heapq.heappush(heap, [0, start])
+    while heap:
+        cost, now = heapq.heappop(heap)
+        for next, value in graph[now]:
+            nextCost = cost + value
+            if nextCost < distance[next]:
+                distance[next] = nextCost
+                heapq.heappush(heap, [nextCost, next])
+    return distance
+
+V, E = map(int, input().split())
+K = int(input())
+graph = [[] for _ in range(V + 1)]
+for _ in range(E):
+    u, v, w = map(int, input().split())
+    graph[u].append((v, w))
+result=dikjstra(K)
+for i in range(1, len(result)):
+    if result[i]==INF:
+        print("INF")
+    else:
+        print(result[i])
