Skip to content

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

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Closed
4 tasks done
sjain1970 opened this issue Jul 20, 2024 · 3 comments · Fixed by #3644
Closed
4 tasks done

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

sjain1970 opened this issue Jul 20, 2024 · 3 comments · Fixed by #3644
Assignees
@sjain1970
Labels
CodeHarborHub - Thanks for creating an issue! documentation Improvements or additions to documentation dsa-solution Label for solutions related to Data Structures & Algorithms. gssoc GirlScript Summer of Code | Contributor GSSOC'24 GirlScript Summer of Code | Contributor level1 GirlScript Summer of Code | Contributor's Levels

Comments

@sjain1970
Copy link
Contributor

Is there an existing issue for this?

  • 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

  • I have read the Contributing Guidelines
  • I'm a GSSOC'24 contributor
  • I have starred the repository
@sjain1970 sjain1970 added the enhancement New feature or request label Jul 20, 2024
@github-actions GitHub Actions
Copy link

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!

@sjain1970
Copy link
Contributor Author

@ajay-dhangar sir, kindly assign me this issue under GSSOC'24.

@ajay-dhangar ajay-dhangar added documentation Improvements or additions to documentation GSSOC'24 GirlScript Summer of Code | Contributor level1 GirlScript Summer of Code | Contributor's Levels gssoc GirlScript Summer of Code | Contributor dsa-solution Label for solutions related to Data Structures & Algorithms. labels Jul 20, 2024
sjain1970 added a commit to sjain1970/gssocproject1 that referenced this issue Jul 20, 2024
@sjain1970
adding solution for tarjans algorithm
d0fe52c 
## Fixing Issue codeharborhub#3626

## Description

This pull request adds the implementation of Tarjan's algorithm in C++ to the DSA folder. Tarjan's algorithm is used for finding strongly connected components (SCCs) in a directed graph. It is efficient with a time complexity of O(V + E), where V is the number of vertices and E is the number of edges in the graph.

## Type of PR

- [ ] Bug fix
- [x] Feature enhancement
- [ ] Documentation update
- [ ] Security enhancement
- [ ] Other (specify): _______________

## Checklist
- [x] I have performed a self-review of my code.
- [x] I have read and followed the Contribution Guidelines.
- [x] I have tested the changes thoroughly before submitting this pull request.
- [x] I have provided relevant issue numbers, screenshots, and videos after making the changes.
- [x] I have commented my code, particularly in hard-to-understand areas.
- [x] I have followed the code style guidelines of this project.
- [x] I have checked for any existing open issues that my pull request may address.
- [x] I have ensured that my changes do not break any existing functionality.
- [x] Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently.
- [x] I have read the resources for guidance listed below.
- [x] I have followed security best practices in my code changes.

## Additional Context

The implementation of Tarjan's algorithm includes:
- Efficient identification of strongly connected components (SCCs) in a directed graph.
- Utilization of depth-first search (DFS) to perform the algorithm.
- Clear and well-commented code for easy understanding and maintenance.

## Resources for Guidance

Please read the following resources before submitting your contribution:

- [x] [Code Harbor Hub Community Features](https://www.codeharborhub.live/community/features)
- [x] [Markdown Guide](https://www.markdownguide.org/)
@sjain1970 sjain1970 mentioned this issue Jul 20, 2024
Merged
18 tasks
@github-actions GitHub Actions
Copy link

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@sjain1970 sjain1970

Labels
CodeHarborHub - Thanks for creating an issue! documentation Improvements or additions to documentation dsa-solution Label for solutions related to Data Structures & Algorithms. gssoc GirlScript Summer of Code | Contributor GSSOC'24 GirlScript Summer of Code | Contributor level1 GirlScript Summer of Code | Contributor's Levels
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

adding solution for tarjans algorithm sjain1970/gssocproject1
2 participants
@ajay-dhangar @sjain1970