[模板] 强连通分量

tarjan
(讲道理信息传递就是这样的？)

#include<iostream>
#include<vector>
#include<stack>
#include<cstdio>
#include<cstring>
#define MAXN 20000
using namespace std;

int m,n;

int ecnt,head[MAXN];
struct Edge{
    int next,to;
}e[MAXN];
inline void add(int x,int y){
    e[++ecnt].to = y;
    e[ecnt].next = head[x];
    head[x]=ecnt;
}

stack<int> S;
bool ins[MAXN];
int dfn[MAXN],low[MAXN],index;
void tarjan(int id){
    dfn[id]=low[id]=++index;
    ins[id]=1;
    S.push(id); 
    for(int i=head[id];i!=-1;i=e[i].next){
        int v=e[i].to;
        if(!dfn[v]){
            tarjan(v);
            low[id]=min(low[id],low[v]);
        }else if(ins[v]){
            low[id]=min(low[id],low[v]);
        }
    }
    if(dfn[id]==low[id]){
        int elm=-1;
        while(!S.empty()&&id!=elm){
            elm=S.top() ;
            S.pop() ;
            cout<<elm<<" ";
            ins[elm]=0;
        }
    }
}

int main(){
    memset(head,-1,sizeof(head));
    cin>>n>>m;
    int x,y;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        add(x,y);
    }
    for(int i=1;i<=n;i++){
        if(dfn[i]) continue;
        tarjan(i);
        cout<<endl;
    }
    return 0;
}