Strongly Connected Components - GeeksforGeeks
Apr 14, 2020 · Following is detailed Kosaraju’s algorithm. 1) Create an empty stack ‘S’ and do DFS traversal of a graph. In DFS traversal, after calling recursive DFS for adjacent vertices of a vertex, push the vertex to stack. In the above graph, if we start DFS from vertex 0, we get vertices in stack as 1, 2, 4, 3, 0.
DA: 17 PA: 1 MOZ Rank: 21 Up or Down: Up