最短路 dijkstra 优先队列优化
<br /> <br />Dijkstra O(E * log E)<br /> <br />/* Dijkstra O(E * log E)INIT: 调用init(nv, ne)读入边并初始化;CALL: dijkstra(n, src); dist[i]为src到i的最短距离 */int cost[E], dist[V];int e, pnt[E], nxt[E], head[V], prev[V], vis[V];struct qnode { int v; i
复制链接