#include <iostream>
using namespace std;
int a[100][100], book[100];
int dis[100];
const int INF = 0x3f3f3f3f;
int main(){
int n, m;//n个顶点,m条边
cin>>n>>m;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(i == j){
a[i][j] = 0;
}else {
a[i][j] = INF;
}
}
}
int tx, ty, d;
for(int i=1; i<=m; i++){
cin>>tx>>ty>>d;
a[tx][ty] = d;
}
for(int j=1; j<=n; j++){
dis[j] = a[1][j];
}
book[1] = 1;
//Dijkstra核心算法
for(int i=1; i<=n-1; i++){
int mmin = INF;
int cur;
for(int j=1; j<=n; j++){
if(book[j] == 0 && dis[j] < mmin){
mmin = dis[j];
cur = j;
}
}
book[cur] = 1;
for(int j=1; j<=n; j++){
if(a[cur][j] < INF && dis[j] > dis[cur] + a[cur][j]){
dis[j] = dis[cur] + a[cur][j];
}
}
}
for(int i=1; i<=n; i++){
cout<<dis[i]<<' ';
}
return 0;
}
Dijkstra 单源最短路径
最新推荐文章于 2022-10-29 02:08:49 发布