Dijkstra求解最短路(堆优化) C++

使用stl优先队列实现小根堆

#include<iostream>
#include<cstring>
#include<queue>

using namespace std;
typedef pair<int,int> PII;

const int N=1e6+10;
int h[N],e[N],w[N],ne[N],idx;
int dist[N];
bool st[N];
int n,m;

void add(int a,int b,int c){
    e[idx] = b;
    w[idx] = c;
    ne[idx] = h[a];
    h[a] = idx ++;
}

int dijkstra(){
    priority_queue<PII,vector<PII>,greater<PII>> heap;
    memset(dist,0x3f,sizeof dist);
    dist[1]=0;
    heap.push({0,1});
    
    while(heap.size()){
        PII t=heap.top();
        heap.pop();
        
        int ver=t.second;
        if(st[ver]) continue;
        st[ver] = true;
        
        for(int i=h[ver];i!=-1;i=ne[i]){
            int j=e[i];
            if(dist[j]>dist[ver]+w[i]){
                dist[j]=dist[ver]+w[i];
                heap.push({dist[j],j});
            }
        }
    }
    if(dist[n]==0x3f3f3f3f) return -1;
    return dist[n];
}

int main(){
    scanf("%d%d",&n,&m);
    memset(h,-1,sizeof h);
    while(m--){
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
    }
    
    printf("%d",dijkstra());
}