今天学一下tarjan求强联通分量,继续整理模板
好文:https://www.sohu.com/a/245954819_100201031
模板:
//输出所有的强联通分量
struct node {
int v, nxt;
}edge[maxm];
int dfn[maxn], low[maxn];
int st[maxn], heads[maxn];
bool vis[maxn];//vis标记是否在栈里
int cnt, tot, index;
void add(int x, int y){
edge[++cnt].nxt = heads[x];
edge[cnt].v = y;
heads[x] = cnt;
}
void tarjan(int x){
dfn[x] = low[x] = ++tot;
st[++index] = x;
vis[x] = 1;
for(int i = heads[x]; i != -1; i = edge[i].nxt){
if(!dfn[edge[i].v]){
tarjan(edge[i].v);
low[x] = min(low[x],low[edge[i].v]);
}
else if(vis[edge[i].v]){//如果访问过,并且还在栈里。
low[x] = min(low[x], dfn[edge[i].v]);//比较谁是谁的儿子/父亲。就是链接对应关系
}
}
if(low[x] == dfn[x]){//强连通分量子树里的最小根
do{
printf("%d ", st[index]);
vis[st[index]] = 0;
index--;
}while(x != st[index+1]);
puts("");
}
}
int main()
{
cnt = index = 0;
memset(heads, -1, sizeof(heads));
int n, m;
scanf("%d %d", &n, &m);
rep(i, 1, m){
int x, y; scanf("%d %d", &x, &y);
add(x, y);//x->y
}
rep(i, 1, n) if(!dfn[i]) tarjan(i);
return 0;
}