Finding Strong Components Using Depth-First Search

Abstract

We survey three algorithms that use depth-first search to find strong components in linear time: the algorithm of Tarjan [Tar72], a natural algorithm that finds cycles and contracts them, and an algorithm that does two searches, one forward, one backward.In memory of Pierre Rosenstiehl, a great colleague, a good friend, and a big fan of depth-first search.