Бикфордов шнур

#include <bits/stdc++.h>

using namespace std;

const int N = 105;
const int inf = 1e9;

int n, m;
int f[N][N];

int main(){
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            f[i][j] = inf;
        }
    }

    for (int i = 0; i < N; i++)
        f[i][i] = 0;

    cin >> n >> m;

    for (int i = 1; i <= m; i++) {
        int u, v, len;
        cin >> u >> v >> len;
        f[u][v] = min(f[u][v], len);
        f[v][u] = min(f[v][u], len);
    }

    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
            }
        }
    }

    int radius = inf, ver = -1;

    for (int v = 1; v <= n; v++) {
        int mx = 0;
        for (int i = 1; i <= n; i++) {
            if (f[v][i] == inf) continue;
            mx = max(mx, f[v][i]);
        }
        if (radius > mx) {
            radius = mx;
            ver = v;
        }
    }

    cout << ver << " " << radius << endl;
}