迪杰斯特拉算法模板

struct Dijkstra
{
    int n,m;//顶点从0开始标号 
    vector<Edge> edges;
    vector<int> G[N];
    bool done[N];
    int d[N],p[N];
    
    void init(int n){//用之前先初始化 
        this->n=n;
        for(int i=0;i<n;i++){
            G[i].clear();
        }
        edges.clear();
    }
    void AddEdge(int from,int to,int dist){//有向 
        edges.push_back(Edge(from,to,dist));
        m=edges.size();
        G[from].push_back(m-1);
    }
    void dijk(int s){//s是源 
        priority_queue<HeapNode> Q;
        for(int i=0;i<n;i++)d[i]=INF;//注意编号 
        d[s]=0;
        memset(done,0,sizeof done);
        Q.push((HeapNode){0,s});
        while(!Q.empty()){
            HeapNode x=Q.top();
            Q.pop();
            int u=x.u;
            if(done[u])continue;
            done[u]=true;
            for(int i=0;i<G[u].size();i++){
                Edge &e=edges[G[u][i]];
                if(d[e.to]>d[u]+e.dist){
                    d[e.to]=d[u]+e.dist;
                    p[e.to]=G[u][i];
                    Q.push((HeapNode){d[e.to],e.to});
                }
            }
        }
    }
    
}a;