Closed chamow97 closed 3 years ago
Adding Kosaraju's Double pass algorithm to find Strongly Connected Components in a graph. This is a famous algorithm which will find SCC in O(V+E) by doing a brilliant trick of reversing the edges of a graph.
Adding Kosaraju's Double pass algorithm to find Strongly Connected Components in a graph. This is a famous algorithm which will find SCC in O(V+E) by doing a brilliant trick of reversing the edges of a graph.