标签:hdoj1874
3 3 0 1 1 0 2 3 1 2 1 0 2 3 1 0 1 1 1 2
2 -1
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
#define INF 0x3f3f3f3f
using namespace std;
int n,m;
int s,e;
int dis[210],vis[210];
struct Edge
{
int from,to,val,next;
}edge[2100];
int head[2100],edgenum;
void add(int u,int v,int w)
{
Edge E={u,v,w,head[u]};
edge[edgenum]=E;
head[u]=edgenum++;
}
void SPFA(int x)
{
queue<int>q;
memset(vis,0,sizeof(vis));
memset(dis,INF,sizeof(dis));
q.push(x);
dis[x]=0;
vis[x]=1;
while(!q.empty())
{
int u=q.front();
q.pop();
vis[u]=0;
for(int i=head[u];i!=-1;i=edge[i].next)
{
int v=edge[i].to;
if(dis[v]>dis[u]+edge[i].val)
{
dis[v]=dis[u]+edge[i].val;
if(!vis[v])
{
vis[v]=1;
q.push(v);
}
}
}
}
if(dis[e]==INF)
printf("-1\n");
else
printf("%d\n",dis[e]);
}
int main(){
while(scanf("%d%d",&n,&m)!=EOF)
{
int a,b,c;
edgenum=0;
memset(head,-1,sizeof(head));
while(m--)
{
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
add(b,a,c);
}
scanf("%d%d",&s,&e);
SPFA(s);
}
return 0;
}
版权声明:博主情人,外人误碰!!!
标签:hdoj1874
原文地址:http://blog.csdn.net/qq_21654717/article/details/47804543