HDU - 1874 畅通工程续 dijkstra算法入门

入门 dijkstra 算法

求两点之间最短路  n² 版本

#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 = 200 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;
int n, m, st, en;
int mp[maxn][maxn], d[maxn], vis[maxn];

void init() {
    memset(mp, INF, sizeof mp);
    int u, v, s;
    for(int i = 0; i < m; ++i) {
        scanf("%d %d %d", &u, &v, &s);
        if(mp[u][v] > s) mp[u][v] = mp[v][u] = s;
    }
    scanf("%d %d", &st, &en);
}

void solve() {
    for(int i = 0; i < n; ++i) {
        d[i] = mp[st][i];
        vis[i] = 0;
    }
    d[st] = 0, vis[st] = 1;
    for(int j = 0; j <= n; ++j) {
        int t = -1;
        for(int i = 0; i < n; ++i) {
            if(!vis[i] && (t == -1 || d[i] < d[t])) t = i;
        }
        if(t == -1) break;
        vis[t] = 1;
        for(int i = 0; i < n; ++i) {
            if(!vis[i]) {
                d[i] = min(d[i], d[t]+ mp[t][i]);
            }
        }
    }
    if(d[en] == INF) d[en] = -1;
    cout << d[en] << endl;
}

int main() {
    while(scanf("%d %d", &n, &m) != EOF && n) {
        init();
        solve();
    }

    return 0;
}