Tarjan
#include<iostream>
#include<vector>
using namespace std;
const int MAX=10001;
int Stop;
int cnt;
int visitNum;
int DFN[MAX];
int LOW[MAX];
bool instack[MAX];
int Stap[MAX];
int Belong[MAX];
int N;
vector<int> tree[MAX];
void tarjan(int i)
{
int j;
DFN[i]=LOW[i]=++visitNum;
instack[i]=true;
Stap[++Stop]=i;
for (unsigned k=0;k<tree[i].size();k++)
{
j=tree[i][k];
if (!DFN[j])
{
tarjan(j);
if (LOW[j]<LOW[i])
LOW[i]=LOW[j];
}
else if (instack[j] && DFN[j]<LOW[i])
LOW[i]=DFN[j];
}
if (DFN[i]==LOW[i])
{
cnt++;
cout<<"连通分量"<<cnt<<": ";
do
{
j=Stap[Stop--];
instack[j]=false;
cout<<j<<" ";
Belong[j]=cnt;
}
while (j!=i);
cout<<endl;
}
}
void solve()
{
Stop=cnt=visitNum=0;
memset(DFN,0,sizeof(DFN));
for (int i=1;i<=N;i++)
if (!DFN[i])
tarjan(i);
}
int main()
{
N=6;
tree[1].push_back(3);
tree[1].push_back(2);
tree[2].push_back(4);
tree[3].push_back(5);
tree[3].push_back(4);
tree[4].push_back(1);
tree[4].push_back(6);
tree[5].push_back(6);
solve();
for(int i=1;i<=N;i++)
cout<<Belong[i]<<" ";
cout<<endl;
return 0;
}