ZOJ 2588 Burning Bridges（无向图求割边，桥）

题目大意：输入n个节点，m条边，现在要去掉一些边，使图仍然连通，求哪些边是不能去掉的，输出不能去掉边的ID号。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
const int N = (int)1e4+10;
struct Edge
{
    int v, tag, nxt;
} edge[N*20];
int head[N], idx;
int n, m;
int dfn[N], low[N], dep;
bool vis[N];
map< pair<int,int>,int  > mp;
vector<int> S;
void AddEdge(int u,int v)
{
    for(int i = head[u]; ~i; i = edge[i].nxt )
        if( edge[i].v == v )
        {
            edge[i].tag++;
            return;
        }
    edge[idx].v = v;
    edge[idx].nxt = head[u];
    edge[idx].tag = 0;
    head[u] = idx++;
}
void tarjan(int u,int pre)
{
    vis[u] = true;
    dfn[u] = low[u] = ++dep;
    for(int i = head[u]; ~i; i = edge[i].nxt )
    {
        int v = edge[i].v;
        if( v == pre ) continue;
        if( !vis[v] )
        {
            tarjan( v, u );
            low[u] = min( low[u], low[v] );
        }
        else low[u] = min( low[u], dfn[v] );
        if( (low[v] > dfn[u]) && !edge[i].tag )
            S.push_back( mp[make_pair(u,v)] );
    }
}
int main()
{
    int T;
    scanf("%d", &T);
    for(int Case = 0; Case < T; Case++)
    {
        if(Case)
            puts("");
        memset( head, -1, sizeof(head));
        idx = 0;
        scanf("%d%d", &n,&m);
        mp.clear();
        for(int i = 0; i < m; i++)
        {
            int u, v;
            scanf("%d%d", &u,&v);
            mp[ make_pair(u,v) ] = mp[ make_pair(v,u) ] = i+1;
            AddEdge(u,v), AddEdge(v,u);
        }
        S.clear();
        memset(vis,0,sizeof(vis));
        dep = 0;
        tarjan(1,0);

        sort(S.begin(), S.end());
        int tot = (int)S.size();
        printf("%d\n", tot);
        for(int i = 0; i < tot; i++)
            printf(i == 0 ? "%d" :" %d", S[i] );
        if(tot)
            puts("");
    }
    return 0;
}