최소비용 구하기 2 풀이 재업로드

saebyeok0306 · saebyeok0306 · commit dba51f7a3043 · 2024-04-26T16:47:20.000+09:00
diff --git a/BAEKJOON/3Gold/최소비용 구하기 2.py b/BAEKJOON/3Gold/최소비용 구하기 2.py
@@ -21,7 +21,6 @@ def dijkstra(N, graph, start):
             dist[_node] = next_cost
             visit[_node] = visit[node] + [_node]
             heapq.heappush(heap, (next_cost, _node))
-    
     return dist, visit
 
 if __name__ == "__main__":
