Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Kosaraju's algorithm

Theory

Applying Kosaraju's algorithm

Report a typo

Given below is a directed graph:

Kosaraju's algorithm and directed graph

Apply Kosaraju's algorithm to find strongly connected components of the graph. Print the found components in the field below. The expected output format is the following:

3 1 2
5 6 4
8 7

Here, each line corresponds to one strongly connected component, and the numbers represent the node labels.

Enter a short text
___

Create a free account to access the full topic