最小割模板

其实最小割就是把一个图分为两部分的最小花费

然后，因为时间复杂度是o（n^3）

所以用邻接表存就好了

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define mem(a) memset(a, 0, sizeof(a))

const int maxv = 500;
const int inf = 0x3f3f3f3f;

int v[maxv], d[maxv];
int G[maxv][maxv];
bool vis[maxv];

int Stoer_Wanger(int n) {
    int res = inf;
    for (int i = 1; i <= n; i++) v[i] = i;

    while (n > 1) {
        int k = 1, pre = 1;
        mem(vis); mem(d);
        for (int i = 2; i <= n; i++) {
            k = -1;
            for (int j = 2; j <= n; j++) {
                if ( !vis[ v[j] ] ) {
                    d[ v[j] ] += G[ v[pre] ][ v[j] ];
                    if (k == -1 || d[ v[k] ] < d[ v[j] ] ) {
                        k = j;
                    }
                }
            }
            vis[ v[k] ] = true;
            if (i == n) {
                res = min(res, d[ v[k] ]);
                for (int j = 1; j <= n; j++) {
                    G[ v[pre] ][ v[j] ] += G[ v[j] ][ v[k] ];
                    G[ v[j] ][ v[pre] ] += G[ v[j] ][ v[k] ];
                }
                v[ k ] = v[ n-- ];
            }
            pre = k;
        }
    }
    return res;
}

int main() {
    int n, m, s, u, v, w;
    while (scanf("%d%d%d", &n, &m, &s) != EOF && s) {
        mem(G);
        for (int i = 0; i < m; i++) {
            scanf("%d%d%d", &u, &v, &w);
            G[u][v] += w;
            G[v][u] += w;
        }
        printf("%d\n", Stoer_Wanger(n));
    }
    return 0;
}