#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5;
const int inf=(1<<20);
const int white=0;
const int gray=1;
const int black=2;
int n;
vector<pair<int,int> >adj[maxn];
void dijkstra()
{
priority_queue<pair<int,int> >q;
int book[maxn],d[maxn];
for(int i=0;i<n;i++){
d[i]=inf;
book[i]=0;
}
d[0]=0;
q.push(make_pair(0,0));
while(!q.empty()){
pair<int,int>f=q.top();
q.pop();
int u=f.second;
book[u]=1;
for(int j=0;j<adj[u].size();j++){
int v=adj[u][j].first;
if(book[v]==1){
continue;
}
if(d[v]>d[u]+adj[u][j].second){
d[v]=d[u]+adj[u][j].second;
q.push(make_pair(d[v]*(-1),v));//默认优先比较较大值,所以乘以-1
}
}
}
for(int i=0;i<n;i++){
cout<<i<<" "<<(d[i]==inf?-1:d[i])<<endl;
}
}
int main()
{
scanf("%d",&n);
int u,k,v,c;
for(int i=0;i<n;i++){
cin>>u>>k;
for(int i=0;i<k;i++){
cin>>v>>c;
adj[u].push_back(make_pair(v,c));
}
}
dijkstra();
return 0;
}
dijkstra算法+邻接表+优先队列
最新推荐文章于 2024-07-24 18:11:53 发布