Added Tarjan’s Algorithm in Java

[coddingjatin]

Tarjan’s Algorithm in Java

This Java program implements Tarjan’s Algorithm to find Strongly Connected Components (SCCs) in a directed graph using an efficient Depth First Search (DFS) approach.

Each node is assigned a discovery time and a low-link value that helps track the earliest reachable vertex.
By maintaining a stack of active nodes, the algorithm identifies when a node is the root of an SCC and extracts all nodes belonging to that component.

It’s widely used in graph theory, compiler design, and network analysis to detect cycles or modular dependencies within complex systems.

Key Features:

• Uses DFS and low-link concepts to identify SCCs.

• Handles multiple disconnected components.

• Prints each SCC as a separate group of vertices.

Complexity Analysis:

Time Complexity: O(V + E) - each vertex and edge is processed once.

Space Complexity: O(V) - for recursion stack, auxiliary arrays, and the vertex stack

[IamBisrutPyne]

Hey @coddingjatin

This is an outstanding contribution.
The Tarjan's Algorithm is a perfect addition to the Algorithms folder.

Happy Hacking ✨