Tarjan's algorithm for SCC
Yash091 opened this issue Β· comments
Yash Chaurasia commented
π Feature
Tarjan's algorithm is used to find the single connected component in a directed graph.
Have you read the Contribution Guidelines?
YES
Pitch
This is an efficient and advanced algorithm for finding SCC.
Assignees
(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @Yash091
Go -
Java -
Javascript -
Kotlin -
Python -
Yash Chaurasia commented
@manan025 Please assign this to me in C++.
Thank you.