跟最短路一样,多了一个不成立的判断
原题连接:http://acm.hdu.edu.cn/showproblem.php?pid=1874
#include<cstdio>
#include<cstring>
const int N=105, INF=9999999;
int d[N], w[N][N],vis[N],n,m;
void Dijkstra(int s){
memset(d,INF,sizeof(d));
d[s] = 0;
memset(vis, 0, sizeof(vis));
for(int i=0; i<n; ++i)
{
int u=-1;
int min=INF;
for(int j=1;j<=n;j++)
{
if(vis[j]==0&&d[j]<min)
{
u=j;
min=d[u];
}
}
vis[u] = 1;
for(int v=0;v<n;v++)
{
if(vis[v]==0&&d[u]+w[u][v]<d[v])
{
d[v]=d[u]+w[u][v];
}
}
}
}
int main()
{
int a,b,c;
while(~scanf("%d%d",&n,&m)){
if(n==0&&m==0)
break;
for(int i=0; i<n; ++i)
{
w[i][i] = INF;
for(int j=i+1; j<=n; ++j)
w[i][j] = w[j][i] = INF;
}
for(int i=0; i<m; ++i){
scanf("%d%d%d",&a,&b,&c);
if(c<w[a][b]) //坑......两点间可能有多条不同路
w[a][b] = w[b][a] = c;
}
int s,e;
scanf("%d%d",&s,&e);
Dijkstra(s);
if(d[e]==INF)
printf("-1\n");
else
printf("%d\n", d[e]);
}
return 0;
}