Graph exploration

Tarjan's Algorithm

Find strongly connected components: groups of nodes where every node can reach every other node by following the arrows.

Teal ring: current node · Gold: active edge · Filled colors: completed components.

Node	Index	Low-link	On stack