Algo_ds_101: Kosaraju's Algorithm | Graphs

[ivinaypathak]

Submission Title

• Kosaraju's Algorithm

Submission Type

• Algorithm

Submission Description

• Kosaraju's algorithm is used to find strongly connected components in graph.
• A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph.

Submission Directory
Algorithm => Graph_Algorithms => Kosaraju's Algorithm => kosaraju_algorithm_strongly_connected_components.cpp

Contributors

• [x] C++ - @ivinaypathak
• [ ] C -
• [ ] Python -
• [ ] Java -
• [ ] JavaScript -
• [ ] TypeScript -
• [ ] Golang -
• [ ] Ruby -
• [ ] php -
• [ ] Swift -
• [ ] C# -

[github-actions[bot]]

👋 @${author}

Thanks for opening your first issue here! Be sure to follow the issue template!

Regards @ahampriyanshu :v:

[riyabhatia26]

Can I pick this?

[shubhamnag14]

i could like to slove this issue...assign me this issue

[ivinaypathak]

I would like to work on this.

[ahampriyanshu]

Hi @shubhamnag14 and @riyabhatia26 :wave: , please mention your preffered language.
@ivinaypathak go ahead with C++.

[shubhamnag14]

i would like to work with python

[shubhamnag14]

assign me this issue then

[riyabhatia26]

Since C++ is taken, I'd like to go for Java.

[LDiazN]

I would like to provide a Rust implementation for this. I know is not listed, so i could do it in C# if you prefer.

[GerardoUbuntu]

I would like to this in TypeScript

[RitayanDas2]

@ahampriyanshu i can do the c implementation

[ahampriyanshu]

thanks everyone :v: