POJ2914:Minimum Cut_最小割模型在信息学竞赛中的应用 applications of minimum cut model -CSDN博客

本文链接：https://blog.csdn.net/lvlawliet/article/details/6923077

Minimum Cut

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 5403		Accepted: 2113
Case Time Limit: 5000MS

Description

Given an undirected graph, in which two vertices can be connected by multiple edges, what is the size of the minimum cut of the graph? i.e. how many edges must be removed at least to disconnect the graph into two subgraphs?

Input

Input contains multiple test cases. Each test case starts with two integers N and M (2 ≤ N ≤ 500, 0 ≤ M ≤ N × (N − 1) ⁄ 2) in one line, where N is the number of vertices. Following are M lines, each line contains M integers A, B and C (0 ≤ A, B < N, A ≠ B, C > 0), meaning that there C edges connecting vertices A and B.

Output

There is only one line for each test case, which contains the size of the minimum cut of the graph. If the graph is disconnected, print 0.

Sample Input

Sample Output

2
1
2

Source

Baidu Star 2006 Semifinal
Wang, Ying (Originator)
Chen, Shixi (Test cases)

全局最小割，模板题，Stor-Wagner算法，大概就是prime的最大生成树，具体的网上有很多，可以google到的，不多说了。
代码：

#include<stdio.h>

#include< string.h>

#define NN 504
#define INF 1 << 30
int vis[NN];
int wet[NN];
int combine[NN];
int map[NN][NN];

int S, T, minCut, N;
void Search()
{
     int i, j, Max, tmp;
    memset(vis, 0, sizeof(vis));
    memset(wet, 0, sizeof(wet));
    S = T = -1;
     for (i = 0; i < N; i++)
    {
        Max = -INF;
         for (j = 0; j < N; j++)
        {
             if (!combine[j] && !vis[j] && wet[j] > Max)
            {
                tmp = j;
                Max = wet[j];
            }
        }
         if (T == tmp) return;
        S = T;
        T = tmp;
        minCut = Max;
        vis[tmp] = 1;
         for (j = 0; j < N; j++)
        {
             if (!combine[j] && !vis[j])
            {
                wet[j] += map[tmp][j];
            }
        }
    }
}
int Stoer_Wagner()
{
     int i, j;
    memset(combine, 0, sizeof(combine));
     int ans = INF;
     for (i = 0; i < N - 1; i++)
    {
        Search();
         if (minCut < ans) ans = minCut;
         if (ans == 0) return 0;
        combine[T] = 1;
         for (j = 0; j < N; j++)
        {
             if (!combine[j])
            {
                map[S][j] += map[T][j];
                map[j][S] += map[j][T];
            }
        }
    }
     return ans;
}
int main()
{
     int a, b, c, M;
     while(scanf("%d%d", &N, &M) != EOF)
    {
        memset(map, 0, sizeof(map));
         while(M--)
        {
            scanf("%d%d%d", &a, &b, &c);
            map[a][b] += c;
            map[b][a] += c;
        }
        printf("%d\n", Stoer_Wagner());
    }
     return 0;
}