dijkstra最短路优化小结

堆优化
把所有dish[i]放在优先队列中，取堆顶dist[u]最小值更新

#include<cstdio>
#include<cstring>
#include<queue>
#define MAXN 100001
#define MAXM 400001
using namespace std;
struct E {
    int u,d;
    bool operator < (const E &t) const {
        return d>t.d;
    }
};
int n,m,s,v[MAXM],Next[MAXM],head[MAXN],w[MAXM],dis[MAXN],tot;
inline void insert(int x,int y,int z) {
    v[++tot]=y,Next[tot]=head[x],head[x]=tot,w[tot]=z;
}
priority_queue<E>q;
inline void dijkstra() {
    for(int i=1;i<=n;i++) dis[i]=0x7fffffff;
    dis[s]=0;
    q.push((E){s,0});
    while(!q.empty()) {
        E now=q.top();q.pop();
        int u=now.u,d=now.d;
        if(d!=dis[u]) continue ;
        for(int i=head[u];i;i=Next[i])
            if(dis[u]+w[i]<dis[v[i]]) {
                dis[v[i]]=dis[u]+w[i];
                q.push((E){v[i],dis[v[i]]});
            }
    }
}
int main()
{
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1,x,y,z;i<=m;i++) scanf("%d%d%d",&x,&y,&z),insert(x,y,z);
    dijkstra();
    for(int i=1;i<=n;i++) printf("%d ",dis[i]);
    printf("\n");
    return 0;
}

配对堆优化

#include <stdio.h>
#include <ext/pb_ds/priority_queue.hpp>
#include <string.h>
#define inf 10000000000000000LL
#include <algorithm>
using namespace std;
typedef pair<long long , int > pii;
//priority_queue <pii, vector<pii>, greater<pii > > q;
using namespace __gnu_pbds;
typedef __gnu_pbds::priority_queue <pii,  greater<pii >, pairing_heap_tag > heap;
heap::point_iterator id[1000005];
struct node 
{
    int u, v, w, next;
}a[10000005];
int tot, n, m, S;
long long dis[1000005];
int rp, T, first[1000005];
void addedge(int st, int end, int val)
{
    a[++tot].u = st;a[tot].v = end;a[tot].w = val;
    a[tot].next =first[st];first[st] = tot;
}
int dij(int S)
{
    heap q;
    for (int i = 1; i <= n; i++)dis[i] = inf;
    id[1] = q.push(make_pair(0, 1));
    dis[1] = 0;
    while (!q.empty())
    {
        int u = q.top().second;q.pop();
        for (int e = first[u]; e != -1; e = a[e].next)
        {
            int v = a[e].v;
            if (dis[u] + a[e].w < dis[v])
            {
                dis[v] = dis[u] + a[e].w;
                if (id[v] != 0)
                    q.modify(id[v], make_pair(dis[v], v));
                else id[v] = q.push(make_pair(dis[v], v));
            }
        }
    }
}
int main()
{
    scanf("%d %d %d", &n, &m, &S);
    int x , y , z , A, B;
    x = y = z = 0;
    memset(first, -1, sizeof(first));
     for (int i = 1; i <= m ; i++)
     {
        scanf("%d %d %d", &x, &y, &z);
        addedge(x, y, z);
     }
     dij(S);
     for (int i = 1; i <= n ; i++)
     	printf("%d ",dis[i]);
    printf("\n");
}

zkw线段树优化
如果T[1]!=MAX，说明还有可以优化的dist，往下找到最小的dist进行更新

#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=1e5+1;
const int MAXM=2e5+1;
template <typename T> inline void read(T& t) {
    int f=0,c=getchar();t=0;
    while(!isdigit(c)) f|=c=='-',c=getchar();
    while(isdigit(c)) t=t*10+c-48,c=getchar();
    if(f) t=-t;
}
int n,m,S,M=1,v[MAXM],Next[MAXM],w[MAXM],head[MAXN],d[MAXN],T[262145];
inline void U(int x,int p) {
    for(T[x+=M]=p,x>>=1;x;x>>=1) T[x]=min(T[x<<1],T[x<<1|1]);
}
inline int F() {
    int i=1;
    while(i<=M-1) i=T[i<<1]==T[i]?i<<1:i<<1|1;
    return i-M;
}
int main()
{
    memset(T,127,sizeof(T));
    memset(d,127,sizeof(d));
    read(n),read(m),read(S);
    while(M<=n) M<<=1;
    for(int i=1,x;i<=m;i++)
        read(x),read(v[i]),read(w[i]),Next[i]=head[x],head[x]=i;
    d[S]=0;
    U(S,0);
    while(T[1]<2e9) {
        int u=F();
        U(u,2e9);
        for(int i=head[u];i;i=Next[i])
            if(d[u]+w[i]<d[v[i]]) {
                d[v[i]]=d[u]+w[i];
                U(v[i],d[v[i]]);
            }
    }
    for(int i=1;i<=n;i++) printf("%d ",d[i]);
    printf("\n");
    return 0;
}