Floyd求无向图最小环

//快读
inline int read(){
    int X=0; bool flag=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') flag=0; ch=getchar();}
    while(ch>='0'&&ch<='9') {X=(X<<1)+(X<<3)+ch-'0'; ch=getchar();}
    if(flag) return X;
    return ~(X-1);
}
//快输
inline void print(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9) print(x/10);
    putchar(x%10+'0');
}

const int inf = 1e8;
int g[105][105],dis[105][105];
int n,m;

//初始化
void init(){
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            dis[i][j] = inf,g[i][j]=inf;
    for(int i=1;i<=n;++i)
        dis[i][i]=0,g[i][i]=0;
}

//floyd顺便求出最小环
bool floyd(int & x){
    int ans = inf;

    for(int k=1;k<=n;++k){
        for(int i=1;i<k;++i)
            for(int j=i+1;j<k;++j)
                if(ans > dis[i][j]+g[j][k]+g[k][i])
                    ans = dis[i][j]+g[j][k]+g[k][i];
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                if(dis[i][j]>dis[i][k]+dis[k][j])
                    dis[j][i] = dis[i][j] = dis[i][k]+dis[k][j];
    }

    if(ans == inf) return false;
    x = ans;
    return true;
}


int main(){

    cin>>n>>m;

    init();

    for(int i=0;i<m;++i){
        int u,v,w;
        cin>>u>>v>>w;
        dis[u][v] = dis[v][u] = g[v][u] = g[u][v] = w;//无向图
    }

    int ans;
    bool f = floyd(ans);
    if(!f) cout<<"No solution.";
    else cout<<ans;

    return 0;
}