Dijkstra算法(c++实现)

Dijkstra算法一种贪婪算法，可以解决图的单源最短路径问题

void Dijkstra(int s, T d[], int p[]){//寻找从顶点s出发的最短路径,在d中存储的是s->i的最短距离//p中存储的是i的父节点if (s < 1 || s > n) throw OutOfBounds();//路径可到达的顶点列表,这里可以用最小堆Chain<int> L; ChainIterator<int> I;//初始化d, p, and Lfor (int i = 1; i <= n; i++){d[i] = a[s][i];if (d[i] == NoEdge) {p[i] = 0;}else {p[i] = s; L.Insert(0,i);}}//更新d, pwhile (!L.IsEmpty()) {//寻找最小d的点vint *v = I.Initialize(L);int *w = I.Next();while (w){if (d[*w] < d[*v])v = w;w = I.Next();}int i = *v;L.Delete(*v);for (int j = 1; j <= n; j++) {if (a[i][j] != NoEdge && (!p[j] || d[j] > d[i] + a[i][j])) {// 刷新更小的d[j] d[j] = d[i] + a[i][j];// 如果j没有父节点,则添加到Lif (!p[j]) L.Insert(0,j);// 更新父节点p[j] = i;}}}}