求有向图的强连通分量 Tarjan算法
参考思路解析:trajan算法
示例:
输入样例:
8 9 // 节点个数,连接个数
1 3 // 每条边的起始点和结束点
2 1
3 2
3 4
4 5
5 6
6 7
7 8
8 5
输出样例:
low: 1 1 1 4 5 5 5 5
dfn: 1 3 2 4 5 6 7 8
scc: 3 3 3 2 1 1 1 1 // 每个元素对应的强连通分量的标号
subnum: 4 1 3 // 不同子集包含的元素个数
C++ 代码实现:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<stack>
using namespace std;
const int MAXN = 10010;
int dfn[MAXN], low[MAXN]; //dfn[i]记录被访问的时间节点, low[i]记录该节点能访问到的最早出现的节点序号
int time, group_index;
int subnum[MAXN], visited[MAXN], scc[MAXN];
stack<int> s;
vector<int> graph[MAXN];
void Tarjan(int u){
time ++;
//初始化
dfn[u] = time;
low[u] = time;
visited[u] = 1;
s.push(u);
for (int i=0; i<graph[u].size(); i++){
int v = graph[u][i];
if (!dfn[v]){
Tarjan(v);
low[u] = min(low[v], low[u]);
}
else if (visited[v] == 1){
low[u] = min(low[v], low[u]);
}
}
// 判断是否为根节点,若是则找到了一个新的强连通分量
if (dfn[u] == low[u]){
int v;
group_index ++;
do{
v = s.top();
scc[v] = group_index;
subnum[group_index] += 1; //记数
visited[v] = 0;
s.pop();
}while(v!=u);
}
}
int main(){
int n, m;
cin >> n >> m;
for (int i=0; i<m; i++){
int tmpx, tmpy;
cin >> tmpx >> tmpy;
graph[tmpx].push_back(tmpy);
}
for(int i=1;i<=n;i++){
if(!dfn[i])
Tarjan(i);
}
cout << "low: ";
for (int i=1; i<=n; i++) cout << low[i] << " ";
cout << endl;
cout << "dfn: ";
for (int i=1; i<=n; i++) cout << dfn[i] << " ";
cout << endl;
cout << "scc: ";
for (int i=1; i<=n; i++) cout << scc[i] << " ";
cout << endl;
cout << "subnum: ";
for (int i=1; i<=group_index; i++) cout << subnum[i] << " ";
cout << endl;
return 0;
}