SPFA入门题-----hdu2544最短路

#include<iostream>
#include<queue>
using namespace std;
#define oo 24454787
int map[105][105],dist[105],n,m;
bool v[105];
void spfa(){
int i,q;
queue<int>Q;
Q.push(1);
memset(v,0,sizeof(v));
v[1]=1;
for(i=2;i<=n;++i){
dist[i]=map[1][i];
if(dist[i]){
Q.push(i);
v[i]=1;
}
else dist[i]=oo;
}
while(!Q.empty()){
q=Q.front();
v[q]=0;
Q.pop();
for(i=2;i<=n;++i){
if(q!=i&&map[q][i]&&dist[i]>dist[q]+map[q][i])
{
dist[i]=dist[q]+map[q][i];
if(!v[i])
Q.push(i),v[i]=1;
}
}
}
printf("%d/n",dist
);
}
int main(){
int i,x,y,z;
while(cin>>n>>m){
if(n+m==0)break;
memset(map,0,sizeof(map));
for(i=0;i<m;++i){
scanf("%d%d%d",&x,&y,&z);
map[x][y]=map[y][x]=z;
}
spfa();
}
return 0;
}