目录
算法选择
存图
邻接表
const int N = 1e6;
int n, m, h[N], e[N], ne[N], idx, w[N], dist[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
return 0;
}
邻接矩阵
const int N = 1e4;
int n, m, mp[N][N], dist[N];
反向建图
用反向图找到一条从A到B的道路后,若翻回原图,则路线会变成B到A。
因此,反向建图之后,跑一遍最短路(Dijkstra | SPFA),得到的就是任意点到源点的最短路。
求最短路有几条
当访问到这个节点时,如果是第一次访问,将这个节点的答案+=他父节点的答案,并将这个节点推到队尾(push)。
如果是第二次访问且当前的距离等于之前记录的距离,说明这是第二条最短路,同样,将这个节点的答案+=他父节点的答案,但不需要(push)了。
if(dist[j] > dist[t] + w[i])
{
cnt[j] = cnt[t];
}
else if (dist[j] == dist[t] + w[i])
{
cnt[j] += cnt[t];
cnt[j] %= mod;
}
判负环
在找最短路的时候当经过的路径中有负环的时候,没经过该负环一次距离减小,重复经过这几个形成负环的点。根据鸽巢原理,n个点的最短路中最多经过n - 1个点,当经过的点数大于等于n的时候说明该路径中存在负环。因此,只需要在spfa中每次更新dist的时候统计经过的点数。
cnt[j] = cnt[t] + 1;
if (cnt[j] >= n) return true;
朴素Dijkstra
模板:
// 稠密图
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 510;
int n, m, g[N][N], dist[N]; // g数组存边,dist数组表示从1到i点的最短距离
bool vis[N]; // 表示每个点的最短路是否已经确定
int dijkstra()
{
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
for (int i = 1; i < n; i ++)
{
int t = -1; // 在未确定最短路的点中找到距离起点最短的点
for (int j = 1; j <= n; j ++)
if (!vis[j] && (t == -1 || dist[t] > dist[j]))
t = j;
// 用t更新其他点的距离
for (int j = 1; j <= n; j ++)
dist[j] = min(dist[j], dist[t] + g[t][j]);
vis[t] = true;
}
if (dist[n] == INF) return -1;
return dist[n];
}
int main()
{
cin >> n >> m;
memset(g, 0x3f, sizeof g);
for (int i = 0; i < m; i ++)
{
int x, y, z;
cin >> x >> y >> z;
g[x][y] = min(g[x][y], z);
}
cout << dijkstra() << endl;
return 0;
}
// 稀疏图
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 1e6 + 10;
int n, m, s, dist[N], e[N], ne[N], idx, h[N], w[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
void dijkstra()
{
for (int i = 1; i <= n; i ++) dist[i] = 2147483647;
dist[s] = 0;
for (int i = 1; i < n; i ++)
{
int t = -1;
for (int j = 1; j <= n; j ++)
if (!vis[j] && (t == -1 || dist[t] > dist[j]))
t = j;
for (int j = h[t]; j != -1; j = ne[j])
dist[e[j]] = min(dist[e[j]], dist[t] + w[j]);
vis[t] = true;
}
}
int main()
{
cin >> n >> m >> s;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
dijkstra();
for (int i = 1; i <= n; i ++) printf("%d ", dist[i]);
return 0;
}
堆优化Dijkstra
模板
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 2e5 + 10;
int n, m, h[N], e[N], ne[N], w[N], idx, dist[N];
bool vis[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>> q;
q.push({0, 1}); // first表示距离, second表示编号
while (q.size())
{
auto t = q.top();
q.pop();
int ver = t.second, distance = t.first;
if (vis[ver]) continue;
vis[ver] = true;
for (int i = h[ver]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > distance + w[i])
{
dist[j] = distance + w[i];
q.push({dist[j], j});
}
}
}
if (dist[n] == INF) return -1;
return dist[n];
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
cout << dijkstra() << endl;
return 0;
}
Bellman-Ford
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 1e5 + 10;
struct Edge
{
int a, b, w;
}edges[N];
int n, m, k, dist[N], backup[N];
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 j = 0; j < m; j ++)
{
int a = edges[j].a, b = edges[j].b, w = edges[j].w;
dist[b] = min(dist[b], backup[a] + w);
}
}
if (dist[n] > INF / 2) return -1;
return dist[n];
}
int main()
{
cin >> n >> m >> k;
for (int i = 0; i < m; i ++)
{
cin >> edges[i].a >> edges[i].b >> edges[i].w;
}
int t = Bellman_ford();
if (t == -1) cout << "impossible" << endl;
else cout << t << endl;
return 0;
}
SPFA
求最短路
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 1e5 + 10;
int n, m, e[N], ne[N], idx, h[N], dist[N], w[N];
bool vis[N];
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;
vis[1] = true;
queue<int> q;
q.push(1);
while (q.size())
{
int t = q.front();
q.pop();
vis[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 (!vis[j])
{
vis[j] = true;
q.push(j);
}
}
}
}
if (dist[n] == INF) return -1;
return dist[n];
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
int t = SPFA();
if (t == -1) puts("impossible");
else cout << t << endl;
return 0;
}
判负环
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 1e6;
int n, m, h[N], e[N], ne[N], idx, dist[N], w[N], cnt[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
bool SPFA()
{
queue<int> q;
for (int i = 1; i <= n; i ++)
{
q.push(i);
vis[i] = true;
}
while (q.size())
{
int t = q.front();
q.pop();
vis[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];
cnt[j] = cnt[t] + 1;
if (cnt[j] >= n) return true;
if (!vis[j])
{
vis[j] = true;
q.push(j);
}
}
}
}
return false;
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
if (SPFA()) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
练习
P3371 【模板】单源最短路径(弱化版)
解法1(朴素Dijkstra):
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 1e6 + 10;
int n, m, s, dist[N], e[N], ne[N], idx, h[N], w[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
void dijkstra()
{
for (int i = 1; i <= n; i ++) dist[i] = 2147483647;
dist[s] = 0;
for (int i = 1; i < n; i ++)
{
int t = -1;
for (int j = 1; j <= n; j ++)
if (!vis[j] && (t == -1 || dist[t] > dist[j]))
t = j;
for (int j = h[t]; j != -1; j = ne[j])
{
int k = e[j];
dist[k] = min(dist[k], dist[t] + w[j]);
}
vis[t] = true;
}
}
int main()
{
cin >> n >> m >> s;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
dijkstra();
for (int i = 1; i <= n; i ++) printf("%d ", dist[i]);
return 0;
}
解法2(堆优化Dijkstra):
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e6 + 10;
int m, n, s, e[N], ne[N], idx, w[N], h[N], dist[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
void dijkstra()
{
for (int i = 1; i <= n; i ++) dist[i] = 2147483647;
dist[s] = 0;
priority_queue<pii, vector<pii>, greater<pii> > heap;
heap.push({0, s});
while (heap.size())
{
pii t = heap.top();
heap.pop();
int ver = t.second, d = t.first;
if (vis[ver]) continue;
vis[ver] = true;
for (int i = h[ver]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > w[i] + d)
{
dist[j] = w[i] + d;
heap.push({dist[j], j});
}
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &s);
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
add(a, b, c);
}
dijkstra();
for (int i = 1; i <= n; i ++) printf("%d ", dist[i]);
return 0;
}
解法3(SPFA):
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 1e6;
int n, m, s, e[N], ne[N], idx, w[N], h[N], dist[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
void SPFA()
{
for (int i = 1; i <= n; i ++) dist[i] = 2147483647;
dist[s] = 0;
queue<int> q;
q.push(s);
vis[s] = true;
while (q.size())
{
int t = q.front();
q.pop();
vis[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 (!vis[j])
{
vis[j] = true;
q.push(j);
}
}
}
}
}
int main()
{
cin >> n >> m >> s;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
SPFA();
for (int i = 1; i <= n; i ++) printf("%d ", dist[i]);
return 0;
}
P1629 邮递员送信
反向建图,将多源一汇最短路变为单源最短路。
解法1(朴素Dijkstra + 反向建图):
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e3 + 10;
int n, m, g[N][N], dist[N];
bool vis[N];
void Dijkstra()
{
memset(dist, 0x3f, sizeof dist);
memset(vis, 0, sizeof vis);
dist[1] = 0;
for (int i = 1; i < n; i ++)
{
int t = -1;
for (int j = 1; j <= n; j ++)
if (!vis[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]);
vis[t] = true;
}
}
int main()
{
cin >> n >> m;
memset(g, 0x3f, sizeof g);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
g[a][b] = min(g[a][b], c);
}
Dijkstra();
int ans = 0;
for (int i = 1; i <= n; i ++) ans += dist[i];
for (int i = 1; i <= n; i ++)
for (int j = i; j <= n; j ++)
swap(g[i][j], g[j][i]);
Dijkstra();
for (int i = 1; i <= n; i ++) ans += dist[i];
cout << ans << endl;
return 0;
}
解法2(堆优化DIjkstra + 反向建图):
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
typedef pair<int, int> pii;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 10;
int n, m, e[N], ne[N], h[N], w[N], idx, dist[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
void Dijkstra(int start)
{
memset(dist, 0x3f, sizeof dist);
memset(vis, 0, sizeof vis);
dist[start] = 0;
priority_queue<pii, vector<pii>, greater<pii> > heap;
heap.push({0, start}); // first distance seconde node
while (heap.size())
{
pii t = heap.top();
heap.pop();
int distance = t.first, ver = t.second;
if (vis[ver]) continue;
vis[ver] = true;
for (int i = h[ver]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > distance + w[i])
{
dist[j] = distance + w[i];
heap.push({dist[j], j});
}
}
}
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
add(b + n, a + n, c);
}
int ans = 0;
Dijkstra(1);
for (int i = 2; i <= n; i ++) ans += dist[i];
Dijkstra(1 + n);
for (int i = 2 + n; i <= 2 * n; i ++) ans += dist[i];
cout << ans << endl;
return 0;
}
解法3(SPFA + 反向建图)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int N = 1e6;
int n, m, e[N], ne[N], h[N], w[N], idx, dist[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
void SPFA(int start)
{
memset(vis, 0, sizeof vis);
memset(dist, 0x3f, sizeof dist);
dist[start] = 0;
queue<int> q;
q.push(start);
vis[start] = true;
while (q.size())
{
int t = q.front();
q.pop();
vis[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 (!vis[j])
{
vis[j] = true;
q.push(j);
}
}
}
}
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
add(b + n, a + n, c);
}
int ans = 0;
SPFA(1);
for (int i = 2; i <= n; i ++) ans += dist[i];
SPFA(1 + n);
for (int i = 2 + n; i <= n * 2; i ++) ans += dist[i];
cout << ans << endl;
return 0;
}
P4779 【模板】单源最短路径(标准版)
解法1(SPFA):
被卡了
解法2(堆优化Dijkstra):
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e6;
int n, m, s, e[N], ne[N], h[N], w[N], idx, dist[N];
bool vis[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}
void Dijkstra(int start)
{
memset(dist, 0x3f, sizeof dist);
dist[start] = 0;
priority_queue<pii, vector<pii>, greater<pii> > heap;
heap.push({0, start});
while (heap.size())
{
pii t = heap.top();
heap.pop();
int distance = t.first, ver = t.second;
if (vis[ver]) continue;
vis[ver] = true;
for (int i = h[ver]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > distance + w[i])
{
dist[j] = distance + w[i];
heap.push({dist[j], j});
}
}
}
}
int main()
{
cin >> n >> m >> s;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c);
}
Dijkstra(s);
for (int i = 1; i <= n; i ++) printf("%d ", dist[i]);
return 0;
}
P1144 最短路计数
解法1(SPFA + 操作计数)
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int mod = 100003;
const int N = 1e7;
int n, m, h[N], e[N], ne[N], idx, dist[N], cnt[N];
bool vis[N];
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
void SPFA()
{
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
cnt[1] = 1;
vis[1] = true;
queue<int> q;
q.push(1);
while (q.size())
{
int t = q.front();
q.pop();
vis[t] = false;
for (int i = h[t]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > dist[t] + 1)
{
dist[j] = dist[t] + 1;
cnt[j] = cnt[t];
if (!vis[j])
{
vis[j] = true;
q.push(j);
}
}
else if (dist[j] == dist[t] + 1)
{
cnt[j] += cnt[t];
cnt[j] %= mod;
}
}
}
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b;
cin >> a >> b;
add(a, b);
add(b, a);
}
SPFA();
for (int i = 1; i <= n; i ++) cout << cnt[i] << endl;
return 0;
}
解法2(堆优化Dijkstra + 操作计数)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e7;
const int mod = 100003;
int n, m, e[N], ne[N], h[N], idx, dist[N], ans[N];
bool vis[N];
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
void Dijkstra()
{
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
ans[1] = 1;
priority_queue<pii, vector<pii>, greater<pii> > heap;
heap.push({0, 1});
while(heap.size())
{
pii t = heap.top();
heap.pop();
int distance = t.first, ver = t.second;
if (vis[ver]) continue;
vis[ver] = true;
for (int i = h[ver]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > distance + 1)
{
ans[j] = ans[ver];
dist[j] = distance + 1;
heap.push({dist[j], j});
}
else if (dist[j] == distance + 1)
{
ans[j] += ans[ver];
ans[j] %= mod;
}
}
}
}
int main()
{
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++)
{
int a, b;
cin >> a >> b;
add(a, b), add(b, a);
}
Dijkstra();
for (int i = 1; i <= n; i ++) cout << ans[i] << endl;
return 0;
}