tarjan求最小加入边而为ebcc模板

#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<set>
using namespace std;
typedef long long ll;
const int maxn=1e4;
const ll inf=1e8;
int cnt,top,num,tot;
int n,r;
int deg[maxn+5];
int dfn[maxn+5],low[maxn+5],vis[maxn+5],s[maxn+5],color[maxn+5];
struct edge{
	int to,next;
}e[2*maxn+5];
int head[maxn+5];
void init()
{
	memset(dfn,0,sizeof(dfn));
	memset(low,0,sizeof(low));
	memset(vis,0,sizeof(vis));
	memset(deg,0,sizeof(deg));
	memset(head,-1,sizeof(head));
	cnt=0;
	top=0;
	num=0;
	tot=0;
}
void tarjan(int x,int fa)
{
	dfn[x]=low[x]=++cnt;
	vis[x]=1;
	s[++top]=x;
	for(int i=head[x];i!=-1;i=e[i].next)
	{
		int v=e[i].to;
		if(!dfn[v])
		{
			tarjan(v,x);
			low[x]=min(low[x],low[v]);
		}
		else if(vis[v]&&v!=fa)
		{
			low[x]=min(low[x],low[v]);
		}
	}
	if(low[x]==dfn[x])
	{
		color[x]=++num;
		vis[x]=0;
		while(s[top]!=x)
		{
			
		//printf("%d %d\n",x,s[top]);
			color[s[top]]=num;
			vis[s[top--]]=0;
		}
		top--; 
	}
}
void add(int u,int v)
{
	e[tot].to=v,e[tot].next=head[u],head[u]=tot++;
}
int main()
{
//	freopen("in.txt","r",stdin);
	scanf("%d%d",&n,&r);
	init();
	int x,y;
	for(int i=1;i<=r;i++)
	{
		scanf("%d%d",&x,&y);
		add(x,y);
		add(y,x);
	}
	for(int i=1;i<=n;i++)
		if(!dfn[i])
			tarjan(i,0);
	//	printf("%d\n",num);
	for(int i=1;i<=n;i++)
		for(int j=head[i];j!=-1;j=e[j].next)
		{
			x=e[j].to;
			if(color[x]!=color[i])
			{
				deg[color[x]]++,deg[color[i]]++;
			}
		}
	int ans=0;
	for(int i=1;i<=num;i++)
		if(deg[i]==2) ans++;
	printf("%d\n",(ans+1)/2);
	return 0;
}