Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Kosaraju's algorithm

Usage

Report a typo

Kosaraju's algorithm is used to find ...

Select one option from the list

weakly connected components in a directed graph.

strongly connected components in a directed graph.

connected components in an undirected graph.

strongly connected components in an undirected graph.

___

Create a free account to access the full topic