dijkstra算法求最短路径

#include <cstdio>
#include <climits>
int n, t;
const int maxn = 1000 + 5;
const int inf = 999999;//要保证大于所有的边，不要取INT—MAX，防止溢出
typedef int vex_type;//顶点类型
int cost[maxn][maxn];
int lowcost[maxn];//lowcost[i]是i点到起点的最短距离
int pre[maxn];//pre[i]是i到起点的最短路径中i的前驱
bool S[maxn];//S[i] == true 表示i点到起点的最短路径已经求出

int dijkstra(vex_type v0){
    for(int i = 1; i <= n; i++){
        lowcost[i] = cost[i][v0];
        S[i] = false;
        if(lowcost[i] == inf) pre[i] = -1;
        else pre[i] = v0;
    }
    lowcost[v0] = 0; S[v0] = true;
    vex_type u;
    for(int i = 1; i < n; i++){
        int minn = inf;
        for(int j = 1; j <= n; j++){
            if(!S[j] && lowcost[j] < minn){
                u = j; minn = lowcost[j];//选择当前的最短路径
            }
        }
        S[u] = true;
        for(int j = 1; j <= n; j++){
            if(!S[j] && (lowcost[u] + cost[u][j] < lowcost[j])){
                lowcost[j] = lowcost[u] + cost[u][j];
                pre[j] = u;
            }
        }
    }
    int v = 1, ans = 0, flag = 1;
    while(pre[v] != n){
        if(pre[v] == -1) return v;//不存在最短路
        ans += cost[v][pre[v]];
        v = pre[v];
    }
    ans += cost[v][n];
    return ans;
}
int main(){
    scanf("%d%d", &t, &n);
    for(int i = 0; i <= n; i++)
        for(int j = 0; j <= n; j++)
            cost[i][j] = inf;
    int x, y, len;
    for(int i = 1; i <= t; i++){
        scanf("%d%d%d", &x, &y, &len);
        if(cost[x][y] != inf){//防止重边，一般不需要这步
            if(cost[x][y] > len) cost[x][y] = cost[y][x] = len;
            continue;
        }
        cost[x][y] = cost[y][x] = len;
    }
    int ans = dijkstra(n);
    printf("%d\n", ans);
    return 0;
}