#include <stdio.h>
#include <string.h>
#define MAX 999999999
#define N 1001
int d[1002],n,m;
int edges[1005][1005];
int queue[1000001];
int SPFA(int s)
{
int i;
bool visit[N] = {false};
int front = 0, rear = 1;
memset(queue,0,sizeof(queue));
for(i=1;i<=n;i++)
d[i] = MAX;
//int path[N];
queue[front] = s;
visit[s] = true;
d[s] = 0;
while(front<rear)
{
int u = queue[front];
visit[u] = false;
for(int i=1; i<=n; i++)
{
if (d[i]>d[u]+ edges[u][i])
{
d[i]= d[u]+edges[u][i];
//path[i] = u;
if( !visit[i] )
{
visit[i] = true;
queue[rear++] = i;
}
}
}
front++;
}
return 0;
}
int main()
{
int i,j,a,b,c;
while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
{
for(i=0;i<=1000;i++){
for(j=0;j<=i;j++)
{
edges[i][j]=MAX;
edges[j][i]=MAX;
}
}
for(i=0;i<m;i++)
{
scanf("%d%d%d",&a,&b,&c);
if(edges[a][b]>c){
edges[a][b]=c;
edges[b][a]=c;
}
}
SPFA(1);
printf("%d\n",d[n]);
}
return 0;
}
hdu 2544 spfa
最新推荐文章于 2021-05-18 22:03:23 发布