dijkstra代码如下

(vector存储)

#include<bits/stdc++.h>
#define N 100010
#define inf 0x3f3f3f3f
using namespace std;
struct edge{int v,w;};
vector<edge>e[N];
int d[N],vis[N],n,m,s;
priority_queue<pair<int,int> >q;
void dij(int s){
	memset(d,inf,sizeof d);
	d[s]=0;q.push({0,s});
	while(q.size()){
		int u=q.top().second;q.pop();
		if(vis[u])continue;
		vis[u]=0;
		for(auto ed:e[u]){
			int v=ed.v,w=ed.w;
			if(d[v]>d[u]+w)d[v]=d[u]+w,q.push({-d[v],v});
		}
	}
	for(int i=1;i<=n;++i)cout<<d[i]<<" ";
	return;
}
int main(){
	cin>>n>>m>>s;
	for(int i=1;i<=m;++i){
		int a,b,c;
		cin>>a>>b>>c;
		e[a].push_back({b,c});
	}
	dij(s);
	return 0;
}

评测记录