#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5+7;
const int INF = 0x3f3f3f;
typedef pair<int,int>PII;
vector<PII>g[maxn] ;
int vis[maxn] ,dis[maxn];
int n,m,u,v,w ;
int main()
{
int start ;
scanf("%d%d%d",&n,&m,&start) ;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&w);
g[u].push_back({v,w});
}
priority_queue<PII>que ;
for(int i=1;i<=n;i++)dis[i] =INF;
dis[start] =0 ;
que.push({0,start});
while(!que.empty())
{
auto x = que.top();
que.pop();
int val = x.first;
int nxt = x.second;
if(vis[nxt])continue;
vis[nxt] =1;
for(int i = 0;i<g[nxt].size();i++)
{
int v = g[nxt][i].first;
int w = g[nxt][i].second;
if(dis[v]>val+w )
{
dis[v] = val + w ;
que.push({dis[v],v});
}
}
}
// dijkstra();
for(int i=1;i<=n;i++)
{
printf("%d ",dis[i]) ;
}
return 0;
}
一天一个小算法——单源最短路径 (djk)
最新推荐文章于 2022-12-17 02:23:45 发布