Finding Strong Components Using Depth-First Search
share
We survey three algorithms that use depth-first search to find strong components in linear time: the algorithm of Tarjan, a natural algorithm that finds cycles and contracts them, and an algorithm that does two searches, one forward, one backward.
READ FULL TEXT