很裸的 dijkstra 算法
跟 prim 算法很像
更新一遍最小路径直接输出就行
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <time.h>
// cout << " === " << endl;
using namespace std;
typedef long long ll;
const int maxn = 100 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;
int n, m, a, b, t;
int mp[maxn][maxn];
int dis[maxn], vis[maxn];
void init() {
memset(mp, INF, sizeof mp);
memset(dis, INF, sizeof dis);
for(int i = 0; i < m; ++i) {
scanf("%d %d %d", &a, &b, &t);
mp[a][b] = mp[b][a] = t;
}
}
void dij() {
for(int i = 1; i <= n; ++i) {
dis[i] = mp[1][i];
vis[i] = 0;
}
dis[1] = 0, vis[1] = 1;
int min_, pos;
for(int j = 1; j <= n; ++j) {
min_ = INF;
for(int i = 1; i <= n; ++i) {
if(!vis[i] && dis[i] < min_) {
min_ = dis[i];
pos = i;
}
}
vis[pos] = 1;
for(int i = 1; i <= n; ++i) {
if(!vis[i] && dis[i] > (dis[pos] + mp[pos][i])) {
dis[i] = (dis[pos] + mp[pos][i]);
}
}
}
}
int main() {
while(scanf("%d %d", &n, &m) != EOF && n && m) {
init();
dij();
printf("%d\n", dis[n]);
}
return 0;
}