8604: GRL_3_A : Articulation Points
[Creator : ]
Description
Find articulation points of a given undirected graph G(V,E).
A vertex in an undirected graph is an articulation point (or cut vertex) iff removing it disconnects the graph.
A vertex in an undirected graph is an articulation point (or cut vertex) iff removing it disconnects the graph.
Input
In the first line, two integers $|V|$ is the number of vertices and $|E|$ is the number of edges in the graph. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.
In the following $|E|$ lines, two integers $s_i$ and $t_i$ represent source and target verticess of $i$-th edge (undirected).
In the following $|E|$ lines, two integers $s_i$ and $t_i$ represent source and target verticess of $i$-th edge (undirected).
Output
A list of articulation points of the graph G ordered by name.
Constraints
1 ≤ |V| ≤ 100,000
0 ≤ |E| ≤ 100,000
The graph is connected
There are no parallel edges
There are no self-loops
0 ≤ |E| ≤ 100,000
The graph is connected
There are no parallel edges
There are no self-loops
Sample 1 Input
4 4
0 1
0 2
1 2
2 3
Sample 1 Output
2
Sample 2 Input
5 4
0 1
1 2
2 3
3 4
Sample 2 Output
1
2
3