Hard
Tarjan's vs. Kosaraju's for strongly connected components
Both Tarjan's and Kosaraju's algorithms find all strongly connected components of a directed graph in O(V+E). Which statement correctly distinguishes their approaches?
22 of 46 in Data Structures & Algorithms