有向图强连通分量模板

有向图强连通分量：在有向图G中，如果两个顶点vi,vj间（vi>vj）有一条从vi到vj的有向路径，同时还有一条从vj到vi的有向路径，则称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。有向图的极大强连通子图，称为强连通分量(strongly connected components)。

#include <bits/stdc++.h>
using namespace std;
const int AX = 1e3+66;
struct Node
{
	int v;
	int next1;
}G[AX];

int head[AX];
int vis[AX];
	int tot = 0;
int index = 0 ;

int DFN[AX], LOW[AX];

int cnt = 0;
void add( int u , int v ){
	G[++cnt].next1 = head[u];
	G[cnt].v = v;
	head[u] = cnt;
}
int stack1[AX];
void tarjan( int x ){
	DFN[x] = LOW[x] = ++tot;
	stack1[++index] = x;
	vis[x] = 1;
	for( int i = head[x] ; ~i ; i = G[i].next1 ){
		if( !DFN[G[i].v] ){
			tarjan(G[i].v);
			LOW[x] = min(LOW[x],LOW[G[i].v]);
		}else if( vis[G[i].v] ){
			LOW[x] = min( LOW[x] , DFN[G[i].v] );
		}
	}
	if( LOW[x] == DFN[x] ){
		do{
			printf("%d ",stack1[index]);
			vis[stack1[index]] = 0;
			index --;
		}while( x != stack1[index+1] );
		printf("\n");
	}
}

int main(){
	int n , m ;
	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] ) tarjan(i);
	}
	return 0 ;
}