本文共 714 字，大约阅读时间需要 2 分钟。

#include 
   
    using namespace std;const int N = 10005, M = 50005;vector
    
      son[N];int dfn[N], low[N], num, s[N], out[N], top, cnt;int scc[N];int sz[N], n, m;void tarjan(int u) {    low[u] = dfn[u] = ++num;    s[++top] = u;    for (int i = 0; i < son[u].size(); ++i) {        if (dfn[son[u][i]] == 0) {            tarjan(son[u][i]);            low[u] = min(low[u], low[son[u][i]]);        } else if (dfn[son[u][i]] < dfn[u]) {            low[u] = min(low[u], dfn[son[u][i]]);        }    }    if (low[u] == dfn[u]) {        ++cnt;        scc[cnt] = top;        sz[cnt] = top - s[0] + 1;        for (int v = s[top]; top-- < s[0]; v = s[--top]) {            out[v] = cnt;            sz[cnt]--;        }    }}
    
   

转载地址：http://iawn.baihongyu.com/