//解决带权有向图中两顶点间最短路径问题。
#include <stdio.h>
#define N 5#define M (1<<20)
int main()
{
int i,j,s[N] = {0};
int dist[];
int array[N][N]={{0,2,4,M,M},
{M,0,1,1,M},
{M,M,0,M,2},
{M,M,1,0,3},
{M,M,M,M,0}
};
int startnode = 0,path,count = 0,min;
s[startnode] = 1;
for(i = 0;i < N;i++)
{
dist[i] = array[startnode][i];
}
count++;
while(count < N-1)
{
path = M;
for(i = 0;i < N;i++)
{
if((s[i]==0)&&(dist[i] < path))
path = dist[i];
min = i;
}
s[min] = 1;
for(i = 0;i < N;i++)
{
if((s[i]==0)&&(dist[min] + array[min][i]< dist[i]))
{
dist[i] = dist[min] + array[min][i];
}
}
count++;
}
for(i = 0;i < N;i++)
{
printf("V%d ->V%d : %d\n",startnode,i,dist[i]);
}
return 0;
}