【模板】Tarjan

出发前一个小时在颓一波板子

void tarjan(int x)
{
    dfn[x]=++num_dfn;
    low[x]=num_dfn;
    ifin[x]=true;
    zhan[++top]=x;
    for (int i=head[x]; i!=0; i=edge[i].next)
    {
        int to=edge[i].to;
        if (!dfn[to])
        {
            tarjan(to);
            low[x]=min(low[x],low[to]);
        }
        else if (ifin[to]) low[x]=min(low[x],dfn[to]);
    }
    if (dfn[x]==low[x])
    {
        ifin[x]=false;
        color[x]=++num_col;
        while (zhan[top]!=x)
        {
            int now=zhan[top--];
            ifin[now]=false;
            color[now]=num_col;
        }
        top--;//不要忘记把x弹出来，此时找到了以x为根（或x）一个强联通分量
    }

一道板子题:
刻录光盘
此题需要缩点；

if (color[edge[i].from]!=color[edge[i],to]]  du[color[edge[i].to]]++;

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int MAXN=100001;
struct Edge{
    int from,next,to;
}edge[MAXN];

int n,top,x,num_col,num_dfn,color[MAXN],dfn[MAXN],low[MAXN],zhan[MAXN];
bool ifin[MAXN];
bool b[MAXN];

int num_edge,head[MAXN];
void add_edge(int from,int to)
{
    edge[++num_edge].next=head[from];
    edge[num_edge].to=to;
    edge[num_edge].from=from;
    head[from]=num_edge;
}

void tarjan(int x)
{
    dfn[x]=++num_dfn;
    low[x]=num_dfn;
    zhan[++top]=x;
    ifin[x]=true;
    for (int i=head[x]; i!=0; i=edge[i].next)
    {
        int to=edge[i].to;
        if (!dfn[to])
        {
            tarjan(to);
            low[x]=min(low[to],low[x]);
        }
        else if (ifin[to]) low[x]=min(low[x],dfn[to]);
    }
    if (dfn[x]==low[x])//找到一个强联通分量 
    {
        ifin[x]=false;
        color[x]=++num_col;
        while (zhan[top]!=x)
        {
            int now=zhan[top--]; 
            ifin[now]=false;
            color[now]=num_col;
        }
        top--;
    }
}

int main()
{
    scanf("%d",&n);
    for (int i=1; i<=n; i++)
    {
        scanf("%d",&x);
        while (x)
        {
            add_edge(i,x);
            scanf("%d",&x);
        }
    }
    for (int i=1; i<=n; i++)
        if (!dfn[i]) tarjan(i);
//  printf("%d",num_col);
    int ans=0;
    for (int i=1; i<=num_edge; i++)
        if (color[edge[i].from]!=color[edge[i].to])
            b[color[edge[i].to]]=true;
    for (int i=1; i<=num_col; i++)
        if (!b[i]) ans++;
    printf("%d",ans);
    return 0;
}
/*
5
2 3 4 0
4 5 0
0
0
1 0
*/