桥的概念:无向连通图中,如果删除某边后,图变 成不连通,则称该边为桥。
一条边(u,v)是桥,当且仅当(u,v)为树枝边,且 满足dfn(u)<low(v)(前提是其没有重边),非树枝边不可 能是桥
模版:
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
#define N 12000
struct node
{
int x,y;
}bridge[N];
int cmp(node A,node B) ///按题目要求排序
{
if(A.x!=B.x)
return A.x < B.x;
return A.y < B.y;
}
int n,dfn[N],low[N],Father[N],Time;
vector<int>G[N];
void init()
{
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
memset(Father,0,sizeof(Father));
Time=0;
for(int i=0;i<n;i++)
G[i].clear();
}
void Tarjan(int u,int fa)
{
Father[u]=fa;
low[u]=dfn[u]=++Time;
int len=G[u].size(), v;
for(int i=0; i<len; i++)
{
v=G[u][i];
if(!low[v])
{
Tarjan(v,u);
low[u]=min(low[u],low[v]);
}
else if(fa != v)
low[u]=min(low[u],dfn[v]);
}
}
void solve()
{
int ans=0;
for(int i=0;i<n;i++)
{
if(!low[i])
Tarjan(i,-1);
}
for(int i=0;i<n;i++)
{
int v=Father[i];
if(v!=-1 && dfn[v]<low[i])
{
bridge[ans].x=i;
bridge[ans].y=v;
if(bridge[ans].x > bridge[ans].y)
swap(bridge[ans].x,bridge[ans].y);
ans++;
}
}
sort(bridge, bridge+ans, cmp);
printf("%d critical links\n",ans);
for(int i=0;i<ans;i++)
{
printf("%d - %d\n",bridge[i].x,bridge[i].y);
}
printf("\n");
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
init();
for(int i=0;i<n;i++)
{
int a,b,m;
scanf("%d (%d)",&a,&m);
while(m--)
{
scanf("%d",&b);
G[a].push_back(b);
G[b].push_back(a);
}
}
solve();
}
return 0;
}