Python 最快到达医院的方法
import heapqdef dijkstra(n, edges, start, end):# 构建邻接表graph = [ for _ in range(n + 1)]for u, v, w in edges:graph[u].append((v, w))
import heapqdef dijkstra(n, edges, start, end):# 构建邻接表graph = [ for _ in range(n + 1)]for u, v, w in edges:graph[u].append((v, w))