dijkstra是一种求单元最短路径的方法。
dis[i]表示源点到i点的最短距离,T集合表示已处理完的点,源点到T中的点的最短距离就是dis[i]。
通过贪心的方法,先将源点至i点的距离从图中拷到dis[i](源点至i点没有路径则设成无限(INF),dis[源点]=0),然后将i点放进集合T,然后再将dis中最小的点(并且不在T里)u加入T,通过u点松弛各点(就是源点到u点再到各点,如果距离更近则更新),直到所有点都加入T。
举个例子:
各点之间的距离如表所示。
map | i=1 | 2 | 3 | 4 | 5 | 6 |
j=1 | 0 | 120 | INF | 50 | INF | INF |
2 | 120 | 0 | 10 | INF | INF | 30 |
3 | INF | 10 | 0 | 30 | INF | INF |
4 | 50 | INF | 30 | 0 | INF | 50 |
5 | INF | INF | INF | INF | 0 | 300 |
6 | INF | 30 | INF | 50 | 300 | 0 |
首先:
i | 1 | 2 | 3 | 4 | 5 | 6 |
dis[i] | 0 | 120 | INF | 50 | INF | INF |
T | 1 |
dis中最小是4点(1点除外)
:4点至3点30,50+30=80,80<INF,dis[3]=80;
:4点至6点50,50+50=100,100<INF,dis[6]=100;
4加入T:
i | 1 | 2 | 3 | 4 | 5 | 6 |
dis[i] | 0 | 120 | 80 | 50 | INF | 100 |
T | 1 | 4 |
i | 1 | 2 | 3 | 4 | 5 | 6 |
dis[i] | 0 | 90 | 80 | 50 | INF | 100 |
T | 1 | 3 | 4 |
然后2点:
i | 1 | 2 | 3 | 4 | 5 | 6 |
dis[i] | 0 | 90 | 80 | 50 | INF | 100 |
T | 1 | 2 | 3 | 4 |
接着6点:
i | 1 | 2 | 3 | 4 | 5 | 6 |
dis[i] | 0 | 120 | 80 | 50 | INF | 100 |
i | 1 | 2 | 3 | 4 | 5 | 6 |
dis[i] | 0 | 90 | 80 | 50 | 400 | 100 |
T | 1 | 2 | 3 | 4 | 6 |
最后5点:
i | 1 | 2 | 3 | 4 | 5 | 6 |
dis[i] | 0 | 90 | 80 | 50 | 400 | 100 |
T | 1 | 2 | 3 | 4 | 5 | 6 |
1点到各点:
1 | 2 | 3 | 4 | 5 | 6 |
0 | 90 | 80 | 50 | 400 | 100 |
代码:
#define size 1000
#define INF 1000000000
#include <cstring>
#include <cstdio>
using namespace std;
int map[size + 1][size + 1];
int dis[size + 1];
int n;
void dijkstra(int begin){
int i,j,pos,x;
bool T[n + 1];
for(i = 1; i <= n; i ++)
dis[i] = map[begin][i];
dis[begin] = 0;
memset(T,0,sizeof(T));
T[begin] = 1;
for(i = 2; i <= n; i ++){
x = INF;
pos = INF;
for(j = 1; j <= n; j ++)
if(! T[j])
if(dis[j] < x){
pos = j;
x = dis[j];
}
if(pos == INF)
break;
T[pos] = 1;
for(j = 1; j <= n; j ++)
if(! T[j])
if(dis[j] > dis[pos] + map[pos][j])
dis[j] = dis[pos] + map[pos][j];
}
}
int main(){
int i,j;
scanf("%d",& n);
for(i = 1; i <= n; i ++)
for(j = 1; j <= n; j ++){
scanf("%d",map[i] + j);
if(map[i][j] == -1)
map[i][j] = INF;
}
dijkstra(1);
for(i = 1; i <= n; i ++)
printf("1->%d:%d\n",i,dis[i]);
return 0;
}