Tarjan's Algorithm

Explanation

- **Tarjan’s Algorithm** is another algorithm used to find **strongly connected components (SCCs)** in a directed graph. It uses a single DFS traversal.
-

• Steps:

  • Perform DFS while maintaining discovery times and the lowest reachable node for each vertex.
  • Use a stack to track the vertices being visited.
  • When a SCC is found, pop the vertices from the stack.

• Time Complexity:

  • O(V + E), where V is the number of vertices and E is the number of edges.