Kosaraju Algorithm Time Complexity
Kosaraju Algorithm Time Complexity . In this paper, we conducted a comparative study of three scc algorithms: O(n+e) where n is the number of nodes and e is the number of edges. AlgoShots from www.algoshots.com Kosaraju suggested it in 1978 but did not publish it, while sharir independently discovered it and published it in 1981. Hence each of these algorithms is used better in some specific systems and domain applications. Sparse, dense, and complete digraphs implemented in.