[FEATURE REQUEST] Kosaraju Algorithm Implementation

[shivu2002a]

What would you like to Propose?

I observed that the Kosaraju algorithm is not yet implemented under the graphs section. So, I'd like to contribute the same.

Issue details

Kosaraju algorithm aims yet finding the strongly connected components. As an undirected graph may have connected components, a directed graph may have strongly connected components.

A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph.

We can find all SCCs in O (V+E) time using Kosaraju Algorithm.

Additional Information

No response

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.