B3647 【模板】Floyd 算法

#include<bits/stdc++.h>
using namespace std;
int f[105][105];
int n,m;
int e,t;
int main()
{
    cin >> n;
    memset(f,0x7f,sizeof(f));
    cin >> m;
    for(int i = 1;i<=m;i++)
    {
        int x,y,z;
        cin >> x >> y >> z;
        f[x][y] = z;
        f[y][x] = z;
    }
    for(int k = 1;k<=n;k++)
    {
        for(int i = 1;i<=n;i++)
        {
            for(int j = 1;j<=n;j++)
            {
                if(i!=j&&i!=k&&j!=k&&f[i][k]+f[k][j]<f[i][j])
                {
                    f[i][j] = f[i][k]+f[k][j];
                }
            }
        }
    }
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<=n;j++)
        {
            if(f[i][j] != 2139062143)
            {
                cout << f[i][j] << " ";
            }
            else
            {
                cout << 0 << " ";
            }
        }
        cout << endl;
    }
    return 0;
}