**Tarjan's Algorithm** is an **efficient graph algorithm** to find the **strongly connected components** in a **directed graph** in **linear time** by utilizing **Depth First Search** traversal of a graph. The key idea used is that nodes of strongly connected component form a subtree in the DFS spanning tree of the graph.

**Read this article to understand Tarjan's Algorithm to find Strongly Connected Components in depth**

**Have a doubt or thought? Join the discussion now**

This is a companion discussion topic for the original entry at http://iq.opengenus.org/tarjans-algorithm/