[Feature Request]: Implementing Tarjan’s Algorithm in C++ under DSA folder.

[sjain1909]

Is there an existing issue for this?

• [X] I have searched the existing issues

Feature Description

I propose adding the implementation of Tarjan’s Algorithm in C++ to the DSA (Data Structures and Algorithms) folder. Tarjan’s Algorithm is used to find strongly connected components (SCCs) in a directed graph. This algorithm is efficient and crucial for various graph-related problems.

Use Case

This feature would enhance the project by providing a robust method for identifying strongly connected components in graphs. For example, in applications involving network analysis, social network analysis, or any domain requiring the detection of strongly connected subgraphs, Tarjan’s Algorithm would offer a precise and efficient solution.

Benefits

Tarjan’s Algorithm provides an efficient way to identify strongly connected components, improving performance in graph-related tasks. The inclusion of this algorithm will help developers and students understand advanced graph algorithms and their applications.

Add ScreenShots

No response

Priority

High

Record

• [X] I have read the Contributing Guidelines
• [X] I'm a GSSOC'24 contributor
• [X] I have starred the repository

[github-actions[bot]]

Hi @sjain1909! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[sjain1909]

@Ajay-Dhangar sir, kindly assign me this issue under GSSOC'24.

[github-actions[bot]]

Hello @sjain1909! Your issue #3626 has been closed. Thank you for your contribution!