Build adjacency list.
Initialize disc[v] = -1, low[v] = 0, , .
For each unvisited vertex, run DFS with :
- Set
disc[v] = low[v] = timer, , - For each neighbor : if unvisited, recurse, , update
low[v], checklow[w] >= disc[v]; if visited (not parent), updatelow[v] - If and , add to result
Return result.
This runs in time and uses space.