-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstrongly_connected_comp.cpp
70 lines (67 loc) · 1.15 KB
/
strongly_connected_comp.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include<bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvl vector<vll>
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector<pii >
#define vpll vector<pll >
#define ff first
#define ss second
#define fastio ios_base::sync_with_stdio(false) , cin.tie(NULL) ,cout.tie(NULL)
using namespace std;
vi g[100001],gt[100001];
vector<bool> vis;
vi order,comp;
void dfs1(int v){
vis[v]=true;
for(int x:g[v]){
if(!vis[x])
dfs1(x)
}
order.pb(v);
}
void dfs1(int v){
vis[v]=true;
for(int x:g[v]){
if(!vis[x])
dfs1(x)
}
order.pb(v);
}
void dfs2(int u){
vis[u]=true;
comp.pb(u);
for(int x:g[u]){
if(!vis[x])
dfs2(x);
}
}
int main(){
fastio;
int n,u,v,m;
cin>>n>>m;
while(m--){
cin>>u>>v;
g[u].pb(v);
gt[v].pb(u);
}
vis.assign(n+2,false);
for(int i=1;i<=n;i++)
if(!vis[i])
dfs1(i);
vis.assign(n+2,false);
for(int i=0;i<n;i++)
{
int v=order[n-i-1];
if(!vis[v])
dfs2(v);
for(int i:comp) cout<<i<<" ";
comp.clear();
}
return 0;
}