tarjan算法模版

有向图的强联通分量

void tarjan( int u )
{
    dfn[u] = low[u] = ++timetamp;
    stk[++top] = u;
    in_stk[u] = true;
    for( int i = h[u] ; i != -1 ; i = ne[i] )
    {
        int j = e[i];
        if( !dfn[j] )
        {
            tarjan(j);
            low[u] = min( low[u] , low[j] );
        }
        else if( in_stk[j] )
        {
            low[u] = min( low[u] , dfn[j] );
        }
    }
    if( dfn[u] == low[u] )
    {
        int y;
        ++dcc_cnt;
        do
        {
            y = stk[top--];
            in_stk[y] = false;
            id[y] = dcc_cnt;
            size[dcc_cnt]++;
        }while( y != u );
     }
}

无向图的强连通分量

1. 缩点

void tarjan( int u , int from)
{
    dfn[u] = low[u] = ++timetamp;
    stk[++top] = u;
    for( int i = h[u] ; i != -1 ; i = ne[i] )
    {
        int j = e[i];
        if( !dfn[j] )
        {
            tarjan( j ,  u );
            low[u] = min( low[u] , low[j] );
            if( dfn[u] < low[j] )
                is_bridge[i] = is_bridge[i^1] = true;
        }
        else if( i != ( from^1) )
            low[u] = min( low[u] , dfn[j] );
     }
     if( dfn[u] == low[u] )
     {
        ++dcc_cnt;
        int y;
        do
        {
            y = stk[top--];  
            id[y] = dcc_cnt;
            s[dcc_cnt]++;
        }while( y != u );
    }
}