search

AlgoGenesis / C

AlgoGenesis is a centralized open-source platform dedicated to providing optimized and well-documented algorithm implementations in C. Perfect for both beginners and advanced users, this repository serves as a comprehensive learning resource for solving algorithmic challenges.
MIT License
92 stars 296 forks source link

[NEW ALGORITHM] TARJAN'S ALGORITHM #1640

Closed surbhisharma004 closed 1 day ago

surbhisharma004 commented 2 days ago

Issue will be closed if:

1) You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2) You propose an algorithm that is already present or has been mentioned in a previous issue.
3) You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

Name:

[NEW ALGORITHM] TARJAN'S ALGORITHM

About:

Propose a new algorithm to be added to the repository Tarjan's Algorithm is used to identify strongly connected components (SCCs) in a directed graph, meaning groups where every node is mutually reachable. It's purpose is to decompose the graph into these SCCs efficiently, often for analyzing graph structure or detecting cycles, and it runs in O(V+E) time, where V is the number of vertices and E is the number of edges. This algo is well-suited for large graphs.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

Assignees:

github-actions[bot] commented 2 days ago

👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!

surbhisharma004 commented 2 days ago

@pankaj-bind assign me this issue.