UVA 1660 Cable TV Network (割点)

题意：求无向图的点连通度

分析：拆点，连一条容量为1的边，其余的边容量为inf，枚举源点和汇点。这样拆点之后一个点就变成的一条边，可是当成割边来做。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <set>
#define FRER() freopen("in.txt","r",stdin)
#define FREW() freopen("out.txt","w",stdout)
#define go int T;cin>>T;for(int kase=1;kase<=T;kase++)
#define debug cout<<"****************"<<endl
#define mod 1000000007
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
template <class T> T gcd(T a,T b){return !b?a:gcd(b,a%b);}
const int N = 10007 , M = 100007 , inf = 0x3f3f3f3f;
int n,m,nEdge,st,ed;
int head[N],d[M],pre[M];
struct Edge {
    int from,to,cap,flow,nxt;
}last[M],now[M];
void addEdge(int u,int v,int c){
    last[nEdge] = {u,v,c,0,head[u]};head[u] = nEdge++;
    last[nEdge] = {v,u,0,0,head[v]};head[v] = nEdge++;
}
int EK(){
    int f = 0;
    while(1){
        memset(d, 0, sizeof(d));
        queue<int>q;
        q.push(st);
        d[st] = inf;
        while(!q.empty()){
            int u = q.front();q.pop();
            for(int e = head[u]; ~e ; e = now[e].nxt){
                int v = now[e].to;
                if(!d[v] && now[e].cap > now[e].flow){
                    pre[v] = e;
                    d[v] = min(d[u] , now[e].cap - now[e].flow);
                    q.push(v);
                }
            }if(d[ed]) break;
        }if(!d[ed]) break;
        for(int u = ed ; u != st ; u = now[pre[u]].from){
            now[pre[u]].flow += d[ed];
            now[pre[u]^1].flow -= d[ed];
        }
        f += d[ed];
    }
    return f;
}
int main(){
    //FRER();
    //FREW();
    while(cin >> n >> m){
        nEdge = 0;
        memset(head, -1, sizeof(head));
        for(int i=0;i<n;i++) addEdge(i, i+n, 1);
        for(int i=0;i<m;i++){
            int u,v;
            scanf(" (%d,%d)",&u,&v);
            addEdge(u+n, v, inf);
            addEdge(v+n, u, inf);
        }
        int ans = n;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                memcpy(now, last, sizeof(last));
                if(i==j) continue;
                st = i+n ; ed = j;
                ans = min(ans,EK());
            }
        }
        cout << ans << endl;
    }
}