Finding Strong Components Using Depth-First Search
Robert Endre Tarjan, Uri Zwick · arXiv (Cornell University) · 2022
We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan's algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.