求边连通度

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <climits>

using namespace std;

#define LL long long
const int INF=0x3f3f3f3f;

const int MAXN = 105;
const int MAXM = 105*105;

struct Edge
{
    int v,nt;
    int flag;
}edge[MAXM];

int cnt;
int n,m;
int s[MAXN],visit[MAXN];
int q[MAXN];

void read_graph(int u, int v, int flag)
{
    edge[cnt].v=v,edge[cnt].flag=flag;
    edge[cnt].nt=s[u],s[u]=cnt++;
    edge[cnt].v=u,edge[cnt].flag=0;
    edge[cnt].nt=s[v],s[v]=cnt++;
}

int bfs(int ss,int ee)
{
    memset(visit,0,sizeof visit);
    visit[ss]=1;
    int head=0,rear=1;
    q[head]=ss;
    while(head<rear)
    {
        int x=q[head++];
        if(x==ee) return 1;
        for(int i=s[x];~i;i=edge[i].nt)
        {
            int v=edge[i].v,flag=edge[i].flag;
            if(!visit[v]&&flag)
            {
                visit[v]=visit[x]+1;
                q[rear++]=v;
            }
        }
    }
    return 0;
}

int dfs(int u,int maxf,int e)
{
    if(u==e) return maxf;
    int ret=0;
    for(int i=s[u];~i;i=edge[i].nt)
    {
        int v=edge[i].v,flag=edge[i].flag;
        if(visit[v]==visit[u]+1&&flag)
        {
            int Min=min(maxf-ret,flag);
            flag=dfs(v,Min,e);
            edge[i].flag-=flag;
            edge[i^1].flag+=flag;
            ret+=flag;
            if(ret==maxf) return ret;
        }
    }
    return ret;
}

int Dinic(int ss,int ee)
{
    int ans=0;
    while(bfs(ss,ee)) ans+=dfs(ss,INF,ee);
    return ans;
}

int main()
{
    while(scanf("%d%d",&n,&m))
    {
        cnt=0;
        memset(s,-1,sizeof s);
        while(m--)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            read_graph(u,v,1);
            read_graph(v,u,1);
        }
        int ans=INF;
        for(int i=2;i<=n;i++) //以1为源点枚举
            ans=min(ans,Dinic(1,i));
        printf("%d\n",ans);
    }
    return 0;
}