Which algorithm finds the strongly connected components of a directed graph by performing two depth-first searches, the second on the transpose graph?
Show answer
Kosaraju's algorithm
Kosaraju's algorithm works by performing a DFS on the original graph to establish an ordering, then performing a DFS on the transposed (reversed) graph to identify components.
Also asked as:
- What algorithm identifies strongly connected components by running a DFS on the original graph and a second DFS on its transpose?