Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Kosaraju's algorithm

Transposed?

Report a typo

After running the first DFS and saving the output times, Kosaraju's algorithm transposes the graph and performs a second DFS on it.

What is a transposed graph?

Select one option from the list

A graph without nontrivial (consisting of more than one node) strongly connected components

A graph rotated by

90

degree

A graph with all edges' directions reversed

A graph where nodes become edges and vice-versa

___

Create a free account to access the full topic