Tarjan's Algorithm
Finds SCCs in one DFS using discovery times and low-link values, $O(V+E)$.
Expert
The same low-link idea finds bridges and articulation points.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.