POJ - 2387 Til the Cows Come Home（dijkstra）

题目大意：n 个点，给出若干条边，无向图，求 1 到 n 的最短距离
解题思路：模板题，没啥好说的

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<string>
#include<queue>
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
const int INF = 0x3f3f3f3f;
const int NINF = -INF -1;
const int MAXN = 1000+5;
using namespace std;
int map[MAXN][MAXN];
int dis[MAXN];
int vis[MAXN];
int t, n;
void dj(int n) {
    for (int i = 1; i <= n; i++)
        dis[i] = map[1][i];
    for (int i = 1; i <= n; i++) {
        int tmp, minn = INF;
        for (int j = 1; j <= n; j++)
            if (!vis[j] && dis[j] < minn) {
                minn = dis[j];
                tmp = j;
            }
        vis[tmp] = 1;
        for (int j = 1; j <= n; j++)
            if (!vis[j] && dis[tmp] + map[tmp][j] < dis[j])
                dis[j] = dis[tmp] + map[tmp][j];
    }
}
int main() {
    while (scanf("%d%d", &t, &n) != EOF) {
        memset(vis, 0, sizeof(vis));
        memset(dis, 0, sizeof(dis));
        for (int i = 0; i <= n; i++)
            for (int j = 0; j <= n; j++)
                map[i][j] = INF;
        for (int i = 0; i < t; i++) {
            int a, b, w;
            scanf("%d%d%d", &a, &b, &w);
            if (w < map[a][b]) {
                map[a][b] = w;
                map[b][a] = map[a][b];
            }
        }
        dj(n);
        printf("%d\n", dis[n]);
    }
    return 0;
}