HDOJ 2544 Dijkstra实现

#include <cstdio>
#include <queue>
#include <cstring>
#include <cmath>

using namespace std;

#define N 100
#define Infinity 233333333

int main(){
    int n, m;
    while (scanf("%d %d", &n, &m), n != 0){
        int map[n][n];
        int dis[n];
        bool shortest[n];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                map[i][j] = Infinity;
        for (int i = 0; i < m; i++){
            int begin, end, temp;
            scanf("%d %d %d", &begin, &end, &temp);
            begin -= 1;
            end -= 1;
            map[begin][end] = min(map[begin][end], temp);
            map[end][begin] = min(map[end][begin], temp);
        }
        for (int i = 0; i < n; i++){
            dis[i] = map[0][i];
            shortest[i] = 0;
        }
        while (1){
            int current = 0;
            for (int i = 1; i < n; i++)
                if (!shortest[i] && dis[i] < dis[current])
                    current = i;
            if (current == n - 1){
                printf("%d
", dis[current]);
                break;
            }
            shortest[current] = 1;
            for (int i = 1; i < n; i++)
                if (dis[current] + map[current][i] < dis[i])
                    dis[i] = dis[current] + map[current][i];
        }
    }
    return 0;
}