A simplified correctness proof for a well-known algorithm computing strongly connected components
The computation of the strongly connected components of a directed graph is one of the fundamental algorithmic graph problems. Linear-time algorithms with simple implementations are known. Here a simplified correctness proof for one of these algorithms is presented. (C) 2001 Elsevier Science B.V. All rights reserved.
algorithms strongly connected components graph problems depth first search