SPFA裸题,似乎没什么好说的…
Code:
#include<cstdio>
#include<cstdlib>
#include<cstring>
struct node{int x,y,c,next;}a[13010];
int n,m,st,ed,len=0;
int f[2510],first[2510],q[3010];
bool v[2510];
void ins(int x,int y,int c){len++;a[len].x=x;a[len].y=y;a[len].c=c;a[len].next=first[x];first[x]=len;}
void spfa()
{
q[1]=st;f[st]=0;v[st]=true;
int head=1,tail=2;
while(head!=tail)
{
int x=q[head];
for(int i=first[x];i;i=a[i].next)
{
int y=a[i].y;
if(f[y]>f[x]+a[i].c)
{
f[y]=f[x]+a[i].c;
if(!v[y])
{
v[y]=true;
q[tail++]=y;
if(tail>n) tail=1;
}
}
}
v[x]=false;
head++;
if(head>n) head=1;
}
}
int main()
{
memset(first,0,sizeof(first));
memset(f,63,sizeof(f));
memset(v,false,sizeof(v));
scanf("%d %d %d %d",&n,&m,&st,&ed);
for(int i=1;i<=m;i++)
{
int x,y,c;
scanf("%d %d %d",&x,&y,&c);
ins(x,y,c);ins(y,x,c);
}
spfa();
printf("%d",f[ed]);
}