强连通分量

 

#include<bits/stdc++.h>
 
using namespace std;
const int maxn = 1e5 + 10;
 
vector<int> G[maxn];
 
int DFN[maxn], LOW[maxn], index, cnt;
int ans[maxn], belong[maxn];
bool vis[maxn];
stack<int> S;
 
void Tarjan(int u) {//这个函数用来找有几个强连通分量
    DFN[u] = LOW[u] = ++index;
    S.push(u);
    int v;
    vis[u] = true;
    for (int i = 0; i < G[u].size(); i++) {
        v = G[u][i];
        if (DFN[v] == 0) {
            Tarjan(v);
            LOW[u] = min(LOW[u], LOW[v]);
        } else if (vis[v])
            LOW[u] = min(LOW[u], DFN[v]);
    }
    if (DFN[u] == LOW[u]) {
        cnt++;
        do {
            v = S.top();
            S.pop();
            vis[v] = false;
            ans[cnt]++;
            belong[v] = cnt;
        } while (u != v);
    }
}
 
int main() {
    //freopen("in", "r", stdin);
    int n, m, u, v;//m个点，n条边，u和v是谁连谁
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> u >> v;
        G[u].push_back(v);
    }
    for (int i = 1; i <= m; i++) {
        if (DFN[i] == 0)
            Tarjan(i);
    }
    cout << cnt << endl;//输出有几个强连通分量
    for (int i = 1; i <= m; i++) {
        cout << i << " " << belong[i] << endl;//输出每个点属于第几个强连通分量
    }
}