Strongly connected components split a directed graph into maximal groups where every vertex can reach every other vertex in the same group. Two classic depth first search methods for finding those ...