姹傝В鏈灝忓壊闆嗘櫘閬嶉噰鐢⊿toer-Wagner綆楁硶錛屼笉鎻愪緵姝ょ畻娉曡瘉鏄庡拰浠ｇ爜錛屽彧鎻愪緵綆楁硶鎬濊礬錛?/font>
1.min=MAXINT錛屽浐瀹氫竴涓《鐐筆
2.浠庣偣P鐢ㄧ被浼紁rim鐨剆綆楁硶鎵╁睍鍑?#8220;鏈澶х敓鎴愭爲”錛岃褰曟渶鍚庢墿灞曠殑欏剁偣鍜屾渶鍚庢墿灞曠殑杈?/font>
3.璁＄畻鏈鍚庢墿灞曞埌鐨勯《鐐圭殑鍒囧壊鍊鹼紙鍗充笌姝ら《鐐圭浉榪炵殑鎵鏈夎竟鏉冨拰錛夛紝鑻ユ瘮min灝忔洿鏂癿in
4.鍚堝茍鏈鍚庢墿灞曠殑閭ｆ潯杈圭殑涓や釜绔偣涓轟竴涓《鐐癸紙褰撶劧浠栦滑鐨勮竟涔熻鍚堝茍錛岃繖涓ソ鐞嗚В鍚э紵錛?/font>
5.杞埌2錛屽悎騫禢-1嬈″悗緇撴潫
6.min鍗充負鎵姹傦紝杈撳嚭min
prim鏈韓澶嶆潅搴︽槸O(n^2)錛屽悎騫秐-1嬈★紝綆楁硶澶嶆潅搴﹀嵆涓篛(n^3)
濡傛灉鍦╬rim涓姞鍫嗕紭鍖栵紝澶嶆潅搴︿細闄嶄負O((n^2)logn)
#include <cstdio>
#include <memory.h>
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
using namespace std;
const int N = 500 + 3;
int n, m;
int mat[N][N];
int dist[N];
int visited[N];
int del[N]; // true琛ㄧず璇ョ偣宸茬粡琚垹鎺?br>
// 緇撶偣~n
int Stoer_Wagner()
{
int minCut = INT_MAX; // 鏃犲悜鍥炬渶灝忓壊
int tmp;
int i, t, j, k, pre;
int s = 1; // 婧愮偣
memset(del, 0, sizeof(del));
for (t = 1; t < n; t++) // n - 1嬈aximum Adjacency Search
{
for (i = 1; i <= n; i++)
if (!del[i])
dist[i] = mat[s][i];
memset(visited, 0, sizeof(visited));
visited[s] = 1;
k = s;
for (i = 1; i <= n - t; i++) // 姣忔鍓╀笅n - t + 1涓粨鐐?/font>
{
tmp = -1e9;
pre = k;
k = 0;
for (j = 1; j <= n; j++)
{
if (!del[j] && !visited[j] && dist[j] > tmp)
{
k = j;
tmp = dist[j];
}
}
if (!k) return 0; // 涓嶈繛閫?/font>
visited[k] = 1;
for (j = 1; j <= n; j++)
if (!del[j] && !visited[j])
dist[j] += mat[k][j];
}
minCut = min(minCut, dist[k]);
del[k] = 1; // 鍒犻櫎k鐐?br>
// 鍚堝茍k鐐瑰拰婧愮偣
for (i = 1; i <= n; i++)
if (!del[i] && i != pre)
{
mat[pre][i] += mat[k][i];
mat[i][pre] = mat[pre][i];
}
}
return minCut;
}
int main ()
{
int u, v, w, i;
while (scanf("%d%d", &n, &m) != EOF)
{
memset(mat, 0, sizeof(mat));
while (m--)
{
scanf("%d%d%d", &u, &v, &w);
if (u == v) continue;
mat[u + 1][v + 1] += w;
mat[v + 1][u + 1] += w;
}
printf("%d\n", Stoer_Wagner());
}
}
]]>