单元点最短路问题Dijkstra算法堆优化模板

模板处理的是有向图，如果是无向图只需要再把节点正反赋两次值就可以了

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int,int> pr;
typedef long long ll;

const ll MAX_N=1e5+5;
const ll INF=1e9+5;
ll n,m;
vector<pr> e[MAX_N];
ll dist[MAX_N];
bool tag[MAX_N];
priority_queue<pr,vector<pr>,greater<pr>> Q;

void Dijkstra(ll S){
	for(ll i=1;i<=n;++i)
		dist[i]=INF;
	dist[S]=0;
	Q.push({0,S});
	ll u,v,w;
	while(!Q.empty()){
		u=Q.top().second;	Q.pop();
		if(tag[u])	continue;
		tag[u]=true;
		for(ll j=0;j<e[u].size();++j)
		{
			v=e[u][j].first;	w=e[u][j].second;
			if(!tag[v]&&dist[v]>dist[u]+w){
				dist[v]=dist[u]+w;
				Q.push({dist[v],v});
			}
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	ll u,v,w,S;
	cin>>n>>m>>S;
	for(ll i=0;i<m;++i)
	{
		cin>>u>>v>>w;
		//节点u到v权值为w
		e[u].push_back({v,w});
	}
	Dijkstra(S);
	for(ll i=1;i<n;++i)
		cout<<dist[i]<<" ";
	cout<<dist[n]<<endl;
	
	return 0;
}