常用最短路算法汇总

常用最短路算法汇总

朴素Dijkstra算法

稠密图时使用（稠密图采用邻接矩阵来存储）

代码

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

int n,m;
const int N = 510;
int g[N][N];
int dis[N];
int st[N];


int dijkstra(){
    
    memset(dis, 0x3f, sizeof dis);
    dis[1] = 0;
    
    for(int i = 1;i <= n;i ++){
        
        int t = -1;
        for(int j = 1;j <= n;j ++)
            if(!st[j] && (t == -1 || dis[t] > dis[j]))
                t = j;
        
        st[t] = true;
        
        for(int j = 1;j <= n;j ++)
            dis[j] = min(dis[j],dis[t] + g[t][j]);
            
    }
    
    if(dis[n] == 0x3f3f3f3f) return -1;
    return dis[n];
    
}

int main()
{
    memset(g, 0x3f, sizeof g);
    cin >> n >> m;
    while(m --){
        int a, b, c;
        cin >> a >> b >> c;
        // 有平行边，取最短的
        g[a][b] = min(g[a][b],c);
        
    }

    int t = dijkstra();
    
    printf("%d\n",t);
    
    return 0;
}

堆优化版的Dijkstra算法

堆可以直接用O(1)的复杂度取得最小的值，所以如果对于稀疏图，可以采用堆优化版的Diujkstra算法

存储方式因为时稀疏图所以采用邻接表存储

代码

#include <iostream>
#include <cstring>
#include <queue>
using namespace std;

typedef pair<int,int> PII;

int n,m;
const int N = 100010 * 2;
int h[N],w[N],e[N],ne[N],idx;
int dist[N];
bool st[N];

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

int dijkstra(){

    memset(dist, 0x3f, sizeof dist);
    dist[1] = 0;

    priority_queue<PII,vector<PII>,greater<PII>> heap;
    heap.push({0,1});

    while(heap.size()){
        PII t = heap.top();
        heap.pop();

        int ver = t.second, distance = t.first;
        if(st[ver]) continue;
        st[ver] = true;

        for(int i = h[ver];i != -1;i = ne[i]){
            int j = e[i];
            if(dist[j] > w[i] + distance){
                dist[j] = w[i] + distance;
                heap.push({dist[j],j});
            }
        }

    }

    if(dist[n] == 0x3f3f3f3f) return -1;
    return dist[n];

}

int main()
{
    cin >> 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());
    return 0;
}

Bellman-ford算法

该算法就是类似于枚举，经过n次松弛操作，每一次将从起点到其它点的距离进行松弛

解决存在负权边的问题

代码

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 510, M = 100010;
int dist[N],backup[N];

struct Edge {
    int a, b, w;
}edges[M];

int n,m,k;

int bellman_ford(){
    
    memset(dist, 0x3f, sizeof dist);
    dist[1] = 0;
    
    for(int i = 0;i < k;i ++){
        
        memcpy(backup, dist, sizeof dist);
        
        for(int i = 0;i < m;i ++){
            int a = edges[i].a, b = edges[i].b, w = edges[i].w;
            dist[b] = min(dist[b],backup[a] + w);
        }
        
    }
    
    if(dist[n] > 0x3f3f3f3f / 2) return -1;
    return dist[n];
    
}

int main()
{
    
    cin >> n >> m >> k;
    for(int i = 0;i < m;i ++){
        int a, b, w;
        scanf("%d%d%d",&a,&b,&w);
        edges[i] = {a, b, w};
    }
    
    int t = bellman_ford();
    if(t == -1) puts("impossible");
    else printf("%d\n",t);
    return 0;
}

SPFA(队列优化的bellman-ford)算法

bellman-ford算法的队列优化就是将已经更新的节点放入队列，因为如果节点未更新，那么对后序以该节点为中转的路径最短不会更新，所以不必要重复判断

代码

#include <iostream>
#include <cstring>
#include <queue>
using namespace std;

const int N = 100010;
int h[N],w[N],e[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 spfa(){
    memset(dist, 0x3f, sizeof dist);
    dist[1] = 0;
    
    queue<int> q;
    q.push(1);
    st[1] = true;
    
    while(q.size()){
        
        int t = q.front();
        q.pop();
        st[t] = false;
        
        for(int i = h[t];i != -1;i = ne[i]){
            int j = e[i];
            if(dist[j] > dist[t] + w[i]){
                dist[j] = dist[t] + w[i];
                if(!st[j]){
                    q.push(j);
                    st[j] = true;
                }
            }
        }
        
    }
    
    if(dist[n] == 0x3f3f3f3f) return -1;
    return dist[n];
}

int main()
{
    memset(h, -1, sizeof h);
    scanf("%d%d",&n,&m);
    while(m --){
        int a, b, c;
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
    }
    
    int t = spfa();
    
    if(t == -1) puts("impossible");
    else printf("%d\n",t);
    return 0;
}

Floyd求多源最短路径

floyd求最短路径基于动态规划，思想就是遍历所有点，以该点为中心点，枚举所有两个顶点，是否能通过中心点达到路径减小

代码

#include <iostream>
#include <cstring>
using namespace std;

int n, m, Q;
const int N = 210,INF = 1e9;
int d[N][N];

void floyd(){

    for(int k = 1;k <= n;k ++){
        for(int i = 1;i <= n;i ++){
            for(int j = 1;j <= n;j ++){
                d[i][j] = min(d[i][j],d[i][k] + d[k][j]);
            }
        }
    }

}

int main()
{
    scanf("%d%d%d",&n,&m,&Q);

    for(int i = 1;i <= n;i ++){
        for(int j = 1;j <= n;j ++){
            if(i == j) d[i][j] = 0;
            else d[i][j] = INF;
        }
    }

    while(m --){
        int a, b, c;
        scanf("%d%d%d",&a,&b,&c);
        d[a][b] = min(d[a][b],c);
    }

    floyd();

    while(Q --){
        int a, b;
        scanf("%d%d",&a,&b);
        if(d[a][b] > INF / 2) puts("impossible");
        else printf("%d\n",d[a][b]);
    }
    return 0;
}