Floyd算法

#include <iostream>
#include <climits>

using namespace std;

int main()
{
    int e[10][10], k, i, j, n, m, t1, t2, t3; 
    cin >> 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] = INT_MAX;

    for (i = 1; i <= m; i++){
        cin >> 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][k] < INT_MAX && e[k][j] < INT_MAX && 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++)
            cout << e[i][j] << " ";

       cout << endl;
    }

    return 0;
}