[NEW ALGORITHM] Add Tarjan's Algorithm

[karthikyandrapu]

Name: Tarjan's Algorithm

Tarjan's Algorithmt

About:

1. The program implements Tarjan's Algorithm for finding Strongly Connected Components (SCCs) in a directed graph. This is achieved through Depth-First Search (DFS) while tracking discovery and low-link values to identify strongly connected subgraphs efficiently.
2. Graph Creation: The createGraph function initializes the graph with an adjacency matrix representation, setting up vertices and edges.
3. SCC Identification: The SCCUtil function is recursively called for each unvisited vertex, updating discovery and low-link values. It maintains a stack to store vertices in the current SCC, printing each SCC once identified.
4. Interactive Display: After defining the graph structure, adding edges, and running the algorithm, the program outputs each SCC found, showcasing how vertices are grouped in strongly connected components.

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it