这道题,看题目就是知道了,就是求全图的最小割。
代码是我在其他人的博客上看到的,感觉很好,可以用做模板,就算是一个新的模板
代码如下:
//Stoer-Wagner
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 550;
const int INF = 0x3fffffff;
int n, m;
int g[N][N], dis[N], v[N];
bool vis[N];
int Stoer_Wagner()
{
int i, j;
int res = INF;
for ( i = 0; i < n; i++ ) v[i] = i;
while ( n > 1 ) {
int maxp = 1, prev = 0;
for ( i = 1; i < n; ++i ) {
dis[v[i]] = g[v[0]][v[i]];
if ( dis[v[i]] > dis[v[maxp]] ) maxp = i;
}
memset( vis, 0, sizeof(vis) );
vis[v[0]] = true;
for ( i = 1; i < n; ++i ) {
if ( i == n - 1 ) {
res = min( res, dis[v[maxp]]);
for ( j = 0; j < n; ++j ) {
g[v[prev]][v[j]] += g[v[j]][v[maxp]];
g[v[j]][v[prev]] = g[v[prev]][v[j]];
}
v[maxp] = v[--n];
}
vis[v[maxp]] = true;
prev = maxp;
maxp = -1;
for ( j = 1; j < n; ++j )
if ( !vis[v[j]] ) {
dis[v[j]] += g[v[prev]][v[j]];
if ( maxp == -1 || dis[v[maxp]] < dis[v[j]] ) maxp = j;
}
}
}
return res;
}
int main()
{
while ( scanf("%d%d", &n, &m) != EOF ) {
memset( g, 0, sizeof(g) );
int s, e, c;
while ( m-- ) {
scanf("%d%d%d", &s, &e, &c);
g[s][e] += c;
g[e][s] += c;
}
printf("%d\n", Stoer_Wagner());
}
}