【Python3】14行でダイクストラ法 - Qiita

from heapq import heappush, heappop def dijkstra(vertices_num, edges, src): dist = [float('inf')] * vertices_num heap = [(0, src)] while len(heap): d, from_ = heappop(heap) if d < dist[from_]: dist[from_] = d for _, to, cost in filter(lambda e: e[0]==from_, edges): heappush(heap, (min(dist[to], dist[from_] + cost), to)) return dist if __name__ == '__main__': answer = dijkstra( 8, [ (0, 1, 5), (0,