Tarjan's Algorithm (SCCs, Bridges & Articulation Points) Interactive Visualizer
Tarjan's Algorithm finds all Strongly Connected Components (SCCs) in a directed graph in a single O(V + E) DFS pass using discovery times, low-link values, and an active stack.
Study Tarjan's Algorithm (SCCs, Bridges & Articulation Points) Explanation · View Multi-Language Code · All Algorithms