III · Graph theory
Connectivity & cycles
What it is
DFS in O(V + E) finds bridges, articulation points, strongly connected components, and topological orderings.
Where it lives
Build-system ordering, deadlock detection, code call graphs, social-network influence.
The key insight
A bridge is an edge whose removal disconnects the graph. Tarjan finds them all in one DFS.