#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf 0x7fffffff
#define linf 0x7fffffffffffffff
#define fill(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",&n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
#define N 10000
#define M 4000009
#define mod 9973
#define pi acos(-1)
#define eps 1e-2
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);
using namespace std;
typedef long long ll;
typedef double db;
int d[105],vis[105];
int m,n;
const int inf=0x3f3f3f3f;
struct go{
int a,t;
go(int x,int y)
{
a=x,t=y;
}
};
vector<go> p[105];
void spfa(int s)
{
int i,temp;
for(i=0;i<=n;i++)
d[i]=inf;
d[s]=0;
vis[s]=1;
queue<int> q;
q.push(s);
while(!q.empty())
{
temp=q.front();
q.pop();
vis[temp]=0;
for(i=0;i<p[temp].size();i++)
{
int v=p[temp][i].a;
if(d[v]>d[temp]+p[temp][i].t)
{
d[v]=d[temp]+p[temp][i].t;
if(vis[v]==0)
{
vis[v]=1;
q.push(v);
}
}
}
}
}
int main()
{
int i,j,a,b,c;
while(cin>>n>>m)
{
if(!n&&!m) break;
for(i=0;i<105;i++)
p[i].clear();
memset(vis,0,sizeof(vis));
for(i=1;i<=m;i++)
{
cin>>a>>b>>c;
p[a].push_back(go(b,c));
p[b].push_back(go(a,c));
}
spfa(1);
cout<<d[n]<<endl;
}
return 0;
}
最短路spfa hdu2544
最新推荐文章于 2021-06-15 21:15:40 发布