Dijkstra模板

Dijkstra算法是一个计算单源最短路径的算法，但是注意图中不能出现负权

这是一个邻接矩阵的模板：

#include <bits/stdc++.h>

using namespace std;

const int maxn = 3005;

vector<pair<int,int> >E[maxn];
int d[maxn];
int n,m,s,t,x,y,z;

void init(){
    for(int i = 0;i < maxn;i++){
        E[i].clear();
        d[i] = 1e9;
    }
}

int main(){
    ios::sync_with_stdio(false);
    while(cin>>n>>m>>s>>t){
        init();
        for(int i = 0;i < m;i++){
            cin>>x>>y>>z;
            E[x].push_back(make_pair(y,z));
            E[y].push_back(make_pair(x,z));
        }
        priority_queue<pair<int ,int> >Q;
        Q.push(make_pair(-d[s],s));
        d[s] = 0;
        while(!Q.empty()){
            int now = Q.top().second;
            Q.pop();
            for(int i = 0;i < E[now].size();i++){
                int v = E[now][i].first;
                if(d[v] > d[now]+E[now][i].second){
                    d[v] = d[now]+E[now][i].second;
                    Q.push(make_pair(-d[v],v));
                }
            }
        }
        if(d[t] == 1e9) cout<<"-1"<<endl;
        else cout<<d[t]<<endl;
    }
    return 0;
}

这是一个邻接表的模板

int cnt, head[maxn]; ll dis[maxn];
struct Edge {
    int v, next; ll w; //记住这里改顺序下面push进队一定要改！
    bool operator < (const Edge &rhs) const {
        return w > rhs.w;
    }
} e[maxn*4];

void add(int u, int v, int co) {
    e[cnt].v = v;
    e[cnt].w = co;
    e[cnt].next = head[u];
    head[u] = cnt++;
}

void init() {
    cnt = 0;
    memset(head, -1, sizeof(head));
}

void dij(int s, int len) {
    priority_queue<Edge> pq;
    for (int i = 1; i <= len; i++)
        dis[i] = inf;
    bool vis[maxn] = {0};
    dis[s] = 0;
    pq.push((Edge){s, 0, 0});
    while (!pq.empty()) {
        Edge tmp = pq.top(); pq.pop();
        if (vis[tmp.v]) continue;
        vis[tmp.v] = 1;
        for (int i = head[tmp.v]; ~i; i = e[i].next) {
            Edge u = e[i];
            if (dis[u.v] > dis[tmp.v] + u.w) {
                dis[u.v] = dis[tmp.v] + u.w;
                pq.push((Edge){u.v, 0, dis[u.v]});
            }
        }
    }
}