题目网址:http://acm.hdu.edu.cn/showproblem.php?pid=2544
题目大意:真·最短路问题
解题思想:SPFA
//SPFA队列优化
#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
const int inf = 1<<30;
const int L = 2000+10;
struct Edges
{
int x,y,w,next;
}e[L<<2];
int head[L];
int dis[L];
int vis[L];
int cnt[L];
int relax(int u,int v,int c)//是否进行松弛
{
if(dis[v]>dis[u]+c)
{
dis[v]=dis[u]+c;
return 1;
}
return 0;
}
void AddEdge(int x,int y,int w,int k)
{
e[k].x = x,e[k].y = y,e[k].w = w,e[k].next = head[x],head[x] = k++;
e[k].x = y,e[k].y = x,e[k].w = w,e[k].next = head[y],head[y] = k++;
}
void init(int n,int m)
{
int i;
memset(e,-1,sizeof(e));
for(i = 0; i<n; i++)
{
dis[i] = inf;
vis[i] = 0;
head[i] = -1;
}
for(i = 0; i<2*m; i+=2)
{
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
AddEdge(x-1,y-1,w,i);
}
}
void SPFA(int src)
{
int i;
memset(cnt,0,sizeof(cnt));
dis[src] = 0;
queue<int> Q;
Q.push(src);
vis[src] = 1;
cnt[src]++;
while(!Q.empty())
{
int u,v;
u = Q.front();
Q.pop();
vis[u]=0;
for(i = head[u];i!=-1;i=e[i].next)
{
v = e[i].y;
if(relax(u,v,e[i].w)==1&&!vis[v])
{
Q.push(v);
vis[v]=1;
}
}
}
}
int main()
{
int n,m,i,j,x,y;
while(~scanf("%d%d",&n,&m)&&n!=0&&m!=0)
{
init(n,m);
x=0;
y=n-1;
SPFA(x);
printf("%d\n",dis[y]==inf?-1:dis[y]);
}
return 0;
}