-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy patharticulation_points.cpp
71 lines (61 loc) · 1.15 KB
/
articulation_points.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
71
#include<bits/stdc++.h>
#define MAXN 105
using namespace std;
typedef long long ll;
vector<ll> graph[MAXN],vis,par,disc,low,ap;
ll t;
void dfs(ll n)
{
ll ch = 0;
vis[n] = true;
low[n] = disc[n] = ++t;
for(auto it: graph[n])
{
if(!vis[it])
{
ch++;
par[it]=n;
dfs(it);
low[n] = min(low[n],low[it]);
if(par[n]!=-1 && disc[n]<=low[it])
ap[n] = true;
}
else if(it!=par[n])
{
low[n] = min(low[n],disc[it]);
}
}
if(par[n]==-1 && ch>1) ap[n]=true;
}
void reset(ll n)
{
vis.assign(n+1,false);
ap.assign(n+1,false);
par.assign(n+1,-1);
disc.assign(n+1,0);
low.assign(n+1,0);
t=0;
}
int main()
{
ll n,m,i,j;
cin>>n>>m;
for(i=1;i<=m;i++)
{
ll a,b;
cin>>a>>b;
graph[a].push_back(b);
graph[b].push_back(a);
}
reset(n);
for(i=1;i<=n;i++)
{
if(!vis[i])
dfs(i);
}
cout<<"Articulation points:\n";
for(i=1;i<=n;i++)
if(ap[i])
cout<<i<<" ";
return 0;
}