UVA-796 Critical Links

求无向图中桥的个数，用Tarjan算法

桥就是图中的一条边，去掉这条边后这个连通块将会不连通

一条边(u,v)是桥当且仅当满足(u,v)为树枝边，且Low[v]>DFN[u]

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
using namespace std;
// Tarjan算法   复杂度O(N+M)
const int MAXN = 10010;//点数
const int MAXM = 100010;//边数
struct Edge
{
	int to,next;
	bool cut;
}edge[MAXM];
int head[MAXN],tot;
int Low[MAXN],DFN[MAXN],Stack[MAXN];
int Index,top;
int scc,bri;
bool Instack[MAXN],cut[MAXN];
int num[MAXN];//各个强连通分量包含点的个数，数组编号1~scc
//num数组不一定需要，结合实际情况
void addedge(int u,int v)
{
	edge[tot].to = v;edge[tot].next = head[u];edge[tot].cut=false;head[u] = tot++;
}
void Tarjan(int u,int pre)
{
	int v;
	Low[u] = DFN[u] = ++Index;
	Stack[top++] = u;
	Instack[u] = true;
	for(int i = head[u];i != -1;i = edge[i].next)
	{
		v = edge[i].to;
		if(v==pre) continue; //忽略直接相连的边
		if(!DFN[v])
		{
			Tarjan(v,u);
			if( Low[u] > Low[v] )Low[u] = Low[v];
			if(Low[v]>DFN[u])
			{
                bri++;
                edge[i].cut=true;
                edge[i^1].cut=true;
			}
		}
		else if( Low[u] > DFN[v])
        Low[u] = DFN[v];
	}
	Instack[u] = false;
	top--;
}
void solve(int N)
{
	memset(DFN,0,sizeof(DFN));
	memset(Instack,false,sizeof(Instack));
	memset(num,0,sizeof(num));
	Index = scc = top =bri= 0;
	for(int i = 1;i <= N;i++)
	if(!DFN[i]) Tarjan(i,i);
    printf("%d critical links\n",bri);
    vector<pair<int,int> > ans;
    for(int u=1;u<=N;u++)
    for(int v=head[u];v!=-1;v=edge[v].next)
    if(edge[v].cut&&edge[v].to>u)
    ans.push_back(make_pair(u,edge[v].to));
    sort(ans.begin(),ans.end());
    for(int i=0;i<ans.size();i++)
    printf("%d - %d\n",ans[i].first-1,ans[i].second-1);
    printf("\n");
}
void init()
{
	tot = 0;
	memset(head,-1,sizeof(head));
}
int main()
{
    //freopen("/home/zlwang/test.txt","r",stdin);
    int n,a,b,m;
    while(~scanf("%d",&n))
    {
        init();
        for(int j=0;j<n;j++)
        {
            scanf("%d (%d)",&a,&m);
            a++;
            for(int i=0;i<m;i++)
            {
                scanf("%d",&b);
                b++;
                if(b<=a) continue;
                addedge(a,b);
                addedge(b,a);
            }
        }
        solve(n);
    }
    return 0;
}