Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Kosaraju's algorithm

Time complexity

Report a typo

Assume that a graph $G$ contains $n$ nodes and $m$ edges. What will be the time complexity of Kosaraju's algorithm for this graph?

Select one option from the list

O(1)

O(n)

O(m)

O(n + m)

___

Create a free account to access the full topic