最短路径--Floyd-Warshall

#include <stdio.h>

int main() {

    int e[10][10], k, j, n, m, t1, t2, t3;
    int inf = 9999999;
    scanf("%d%d", &n, &m);
    //初始化
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            if (i == j) e[i][j] = 0;
            else e[i][j] = inf;
        }
    }
    //读入边
    for (i = 1; i <= m; i++) {
        scanf("%d%d%d",&t1, &t2, &t3);
        e[t1][t2] = t3;

    }
    //Floyd-Warshall 算法核心语句
    for (k = 1; k <= n; k++) 
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (e[i][j] > e[i][k] + e[k][j])
                    e[i][j] = e[i][k] + e[k][j];
    //输出最终的结果
    for (i = 1; i <= n; i++){
        for (j = 1; j <= n; j++) {
            printf("%10d", e[i][j]);
        }
        printf("\n");
    }
    

    return 0;
}