Explain the Tarjan's SCC Algorithm.

Explain the Tarjan's SCC Algorithm.

Approach: Describe a DFS-based algorithm to find strongly connected components.

An algorithm in graph theory for finding the strongly connected components of a directed graph. It uses a single DFS pass and a stack to keep track of nodes in the current search path.

Follow-up: What is a 'low-link' value?

Key concepts: dfs, low-link value, stack.