-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArticulationpoint.cpp
More file actions
73 lines (68 loc) · 1.14 KB
/
Copy pathArticulationpoint.cpp
File metadata and controls
73 lines (68 loc) · 1.14 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
#include<bits/stdc++.h>
using namespace std;
int ap[10010];
int tim[10010];
int low[10010];
int t=0;
void dfs(vector<int>list[],int sv,int p,bool *vis)
{
vis[sv]=1;
low[sv]=tim[sv]=++t;
int ch=0;
for(auto to:list[sv])
{
if(to==p)
{
continue;
}
if(!vis[to])
{
ch++;
dfs(list,to,sv,vis);
low[sv]=min(low[sv],low[to]);
if(p!=-1 && tim[sv] <= low[to])
{
ap[sv]=1;
}
if(p==-1 and ch>1)
{
ap[sv]=1;
}
}
else
{
low[sv]=min(low[sv],tim[to]);
}
}
}
int main()
{
int n,m;
cin>>n>>m;
int a[n];
//for(int i=0;i<n;cin>>a[i++]);
vector<int>list[n+1];
for(int i=0;i<m;i++)
{
int u,v;
cin>>u>>v;
list[u-1].push_back(v-1);
list[v-1].push_back(u-1);
}
memset(ap,0,sizeof(ap));
memset(tim,0,sizeof(tim));
memset(low,0,sizeof(low));
bool *vis=new bool[n+1]();
for(int i=0;i<n;i++)
{
if(!vis[i])
{
dfs(list,i,-1,vis);
}
}
for(int i=0;i<n;i++)
{
if(ap[i])
cout<<i+1<" ";
}
}