floyd求最小环

模板是求顶点大于2的最小环；小于等于2的就将g[i][i]赋值为0，并去掉i,j,k不能相等的判断就可以了，模板对应HDU 1599

#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;
int g[N][N], dis[N][N];

int main(){
    int T, n, m;
    while(cin >> n >> m){
        int i, j, k, a, b, w;
        for(i = 1;i <= n;i++)
            for(j = 1;j <= n;j++)
               dis[i][j] = g[i][j] = INT_MAX;
        for(i = 0;i < m;i++){
            scanf("%d%d%d", &a, &b, &w);
            g[a][b] = g[b][a] = min(w, g[a][b]);
            dis[a][b] = dis[b][a] = g[a][b];
        }
        int res = INT_MAX;
        for(k = 1;k <= n;k++){
            for(i = 1;i <= n;i++)
                for(j = 1;j <= n;j++)
                    if(dis[i][j] != INT_MAX && g[j][k] != INT_MAX && g[k][i] != INT_MAX
                       &&i != j && i != k && j != k)
                        res = min(res, dis[i][j] + g[j][k] + g[k][i]);

            for(i = 1;i <= n;i++)
                for(j = 1;j <= n;j++)
                    if(dis[i][k] != INT_MAX && dis[k][j] != INT_MAX)
                        dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
        }
        if(res == INT_MAX)
            printf("It's impossible.\n");
        else
            printf("%d\n", res);
    }

    return 0;
}