= Tarjan's strongly connected components algorithm
{wiki=Tarjan's_strongly_connected_components_algorithm}
Tarjan's algorithm is a classic method in graph theory used to find the strongly connected components (SCCs) of a directed graph. A strongly connected component is a maximal subgraph where every vertex is reachable from every other vertex within that subgraph. Tarjan's algorithm is particularly efficient, operating in linear time, O(V + E), where V is the number of vertices and E is the number of edges in the graph.
Back to article page
