1.Dijkstra求最短路(原始)
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 510;
int n, m;
int g[N][N];
int 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;
return dist[n];
}
int main()
{
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(g[a][b], c);
}
printf("%d\n", dijkstra());
return 0;
}
2,Dijkstra求最短路(堆优化)
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int, int> PII;
const int N = 1e6 + 10;
int n, m;
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())
{
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;
return dist[n];
}
int main()
{
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);
}
cout << dijkstra() << endl;
return 0;
}
3,spfa
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
int n , m , s, t;
int ne[100010],w[100010],e[100010],h[1000010];
int dist[1000010];
bool st[1000010];
int idx;
void add(int a,int b,int c)
{
e[idx] = b;
w[idx] = c;
ne[idx] = h[a];
h[a] = idx ++;
}
void spfa()
{
memset(dist, 0x3f3f3f3f,sizeof dist);
queue<int>q;
q.push(s);
dist[s] = 0;
st[s] = true;
while(!q.empty())
{
int g = q.front();
st[g] = false;
for(int i = h[g]; ~i; i = ne[i])
{
int j = e[i];
if(dist[j] > dist[g] + w[i])
{
dist[j] = dist[g] + w[i];
if(!st[j])
{
q.push(j);
st[j] = true;
}
}
}
q.pop();
}
}
int main()
{
int x, y, l;
memset(h, -1, sizeof h);
cin >> n >> m >> s >> t;
for(int i = 0;i < m ;i ++)
{
cin >> x >> y >> l;
add(x, y, l);
add(y, x, l);
}
spfa();
cout << dist[t];
return 0;
}