-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathArticulartion Points .cpp
More file actions
73 lines (60 loc) · 1.46 KB
/
Copy pathArticulartion Points .cpp
File metadata and controls
73 lines (60 loc) · 1.46 KB
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
72
73
const int N = 1e5;
vector<int>graph[N];
bool vis[N];
vector<int>parent(N,-1);
int dis[N];
int low[N];
set<int>AP;
void dfs(int s , int time = 0)
{
time++;
vis[s] = true;
dis[s] = low[s] = time;
int childno = 0;
for(auto child : graph[s])
{
if(parent[s]==child)
{
continue;
}
if(vis[child])
{
low[s] = min(low[s],dis[child]);
continue;
}
childno++;
parent[child] = s;
dfs(child, time);
low[s] = min(low[s],low[child]);
if(parent[s]!=-1 && dis[s]<=low[child]) // make sure s is not the root
{
AP.insert(s);
}
}
if(s==0 && childno>1) // handling the root case
{
AP.insert(s);
}
return;
}
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
cin>>x>>y;
graph[x].push_back(y);
graph[y].push_back(x);
}
dfs(0);
for(auto x : AP)
{
cout<<x<<" ";
}
cout<<endl;
return 0;
}