Tarjan’s Algorithm
← Back to Strongly Connected Components
A DFS-based algorithm that finds all strongly connected components in a directed graph in a single pass. Uses a stack and low-link values to identify SCCs. O(V + E) time.
← Back to Strongly Connected Components
A DFS-based algorithm that finds all strongly connected components in a directed graph in a single pass. Uses a stack and low-link values to identify SCCs. O(V + E) time.