ZOJ 2588 Burning Bridges 割边

题意：N个岛有M个桥相连，烧掉尽可能多的桥，让N个岛仍然相连，问必须不能烧掉的桥的个数及编号。就是求割边

割边与割点差不多都是tarjan式的dfs，有两个地方不一样 见代码

代码： 

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#define nMAX 10005
#define mMAX 200010
#define Min(a,b)a<b?a:b
using namespace std;
int head[nMAX],dfn[nMAX],low[nMAX],bridge[mMAX];
int n,times,s_edge,nbridge;
struct Edge
{
    int v,nxt,id;//id记录第几个桥
}edge[mMAX];

void addedge(int u,int v,int id)
{

    edge[++s_edge].v=v;
    edge[s_edge].nxt=head[u];
    edge[s_edge].id=id;
    head[u]=s_edge;

    edge[++s_edge].v=u;
    edge[s_edge].nxt=head[v];
    edge[s_edge].id=id;
    head[v]=s_edge;

}
void tarjan(int u,int fa)
{
    bool fg=0;//判断重边,重边不是割边,炸掉不被
    dfn[u]=low[u]=++times;
    for(int e=head[u];e;e=edge[e].nxt)
    {
        int v=edge[e].v;
        if(v==fa&&!fg)//判断重边
        {
            fg=1;
            continue;
        }
        if(!dfn[v])
        {
            tarjan(v,u);
            low[u]=Min(low[u],low[v]);
            //1.没有根节点的判断 2.割点中if(low[v]>=dfn[u])，
            //而割边if(low[v]>dfn[u)没有=号
            if(low[v]>dfn[u])
                bridge[nbridge++]=edge[e].id;
        }
        else low[u]=Min(low[u],dfn[v]);
    }
}
void init()
{
    memset(head,0,sizeof(head));
    memset(dfn,0,sizeof(dfn));
    s_edge=1;
    times=0;
}
int main()
{
    int CASE,i,j,k,m;
    scanf("%d",&CASE);
    while(CASE--)
    {
        init();
        scanf("%d%d",&n,&m);
        for(k=1;k<=m;k++)
        {
            scanf("%d%d",&i,&j);
            addedge(i,j,k);
        }
        nbridge=0;
        tarjan(1,-1);
        printf("%d\n",nbridge);
        if(nbridge)
        {
          sort(bridge,bridge+nbridge);
          for(i=0;i<nbridge-1;i++)
          printf("%d ",bridge[i]);
          printf("%d\n",bridge[i]);
        }
        if(CASE)printf("\n");
    }
    return 0;
}

　　

　　

转载于:https://www.cnblogs.com/sdau10kuaile/archive/2012/04/10/2441349.html