图中的最短路——两种dijkstra写法

一：朴素写法

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

const int N = 510;
int n,m;
// 稠密图，使用邻接矩阵存储
int g[N][N],dist[N];
bool st[N];

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

int main(void)
{
    scanf("%d%d",&n,&m);
    memset(g,0x3f,sizeof g);
    while (m -- )
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        g[a][b] = min(c,g[a][b]);
    }
    int ans = dijkstra();
    printf("%d\n",ans);
    return 0;
}

二：使用堆优化：

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

const int N = 1000010;
// 使用邻接表储存
int h[N],e[N],ne[N],w[N],idx;
typedef pair<int,int> PII;
int n,m;
int dist[N];
bool st[N];

void add(int a,int b,int c)
{
    e[idx]=b,ne[idx]=h[a],w[idx]=c,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())
    {
        auto 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]>dist[ver]+w[i])
            {
                dist[j]= dist[ver]+w[i];
                heap.push({dist[j],j});
            }
        }
    }
    if(dist[n]==0x3f3f3f3f) return -1;
    else return dist[n];
}


int main(void)
{
    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);
    }
    int ans = dijkstra();
    printf("%d\n",ans);
    return 0;
}