//P3371【模板】单源最短路径(弱化版)
//spfa:适用于有负权路(无负环)情况
//复杂度高于dijkstra
#include <iostream>
#include <cstdio>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
#define MAXN 10005
#define MAXM 500005
#define INF 2147483647
int N,M,S;
int head[MAXN]={0};
int dis[MAXN];
bool used[MAXN]={false};
struct Node
{
int next;
int to;
int dis;
}edge[MAXM];//链式向前星储存图
void scanff()
{
int a,b,c;
cin>>N>>M>>S;
int edge_num=0;
for(int i=1;i<=M;i++)
{
cin>>a>>b>>c;
edge[++edge_num].next=head[a];
edge[i].dis=c;
edge[i].to=b;
head[a]=edge_num;
}
for(int i=1;i<=N;i++)
dis[i]=INF;
dis[S]=0;
}
//spfa
queue<int> q;
void spfa()
{
q.push(S);
used[S]=true;
//和dijkstra不同,所有点可以重复入队
while(!q.empty())
{
int temp=q.front();
q.pop();
used[temp]=false;
//入队为true,队外为false
for(int i=head[temp];i;i=edge[i].next)
{
//遍历所有以出队节点为起始点边
int t=edge[i].to;
if(dis[t]>edge[i].dis+dis[temp])
{
dis[t]=edge[i].dis+dis[temp];
if(!used[t])
{
//重复入队
used[t]=true;
q.push(t);
}
}
}
}
for(int i=1;i<=N;i++)
cout<<dis[i]<<" ";
}
int main()
{
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
scanff();
spfa();
return 0;
}
单源最短路径:spfa
最新推荐文章于 2021-07-25 14:30:17 发布