在看我这篇博客之前,请大家观看B站的视频 链接:Dijkstra,floyd算法动画演示讲解,这位up主讲的很好,然后你看模板代码,以及我给的例题,相信你会有所收获。下列过程如果大家看不懂,建议自己列出样例,用纸笔模拟这个程序执行过程。
1.Dijkstra算法
Dijkstra算法解决的是单源最短路问题,并且边权只能为正值。
//模板
int n, g[MAXV][MAXV];
bool visit[MACV] = {false};
int dis[MAXV]//起点到各点的最短长度
void Dijkstra(int s)//s为起点
{
fill(dis, dis + MAXV, INF);//初始化无穷大
dis[s] = 0;//起点到自身距离为0
for(int i = 0; i < n; i++){
int u = -1, minn = INF;
for(int j = 0; j < n; j++){
if(visit[j] == false && dis[j] < minn){
u = -1; minn = dis[j];
}
}
if(u == -1) return;//说明剩下的点和s不连通
visit[u] = true;//标记u已被访问
for(int v = 0; v < n; v++){
//寻找最佳中介点可以使距离变短
if(visit[v] == false && g[u][v] != INF && dis[u] + g[u][v] < dis[v])
dis[v] = dis[u] + g[u][v];
}
}
}
例题:链接 紧急救援
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 99999999;
int g[510][510], weight[510], dis[510], num[510], path[510], w[510];
bool visit[510];
int n, m, s1, s2;
void printPath(int v){
if(v == s1){
cout << v;
return ;
}
printPath(path[v]);
cout << " " << v;
}
int main(){
fill(dis, dis + 510, inf);
fill(g[0], g[0] + 510 * 510, inf);
cin >> n >> m >> s1 >> s2;
for(int i = 0; i < n; i++) cin >> weight[i];
int a, b, c;
for(int i = 0; i < m; i++){
cin >> a >> b >> c;
g[a][b] = c;
g[b][a] = c;
}
dis[s1] = 0;
w[s1] = weight[s1];
num[s1] = 1;
for(int i = 0; i < n;i++){
int u = -1, minn = inf;
for(int j = 0; j < n; j++){
if(visit[j] == false && dis[j] < minn){
u = j;
minn = dis[j];
}
}
if(u == -1) break;
visit[u] = true;
for(int v = 0; v < n; v++){
if(visit[v] == false && g[u][v] != inf){
if(dis[u] + g[u][v] < dis[v]){
dis[v] = dis[u] + g[u][v];
num[v] = num[u];
w[v] = w[u] + weight[v];
path[v] = u;
}else if(dis[u] + g[u][v] == dis[v]){
num[v] = num[u] + num[v];
if(w[u] + weight[v] > w[v]){
w[v] = w[u] + weight[v];
path[v] = u;
}
}
}
}
}
cout << num[s2] << " " << w[s2] << endl;
printPath(s2);
return 0;
}