Cycle Detected: Graph Search from Mazes to Build Systems

Deep End Era. Engineering with Sankalp · Oct 28, 2026 · 51m

Two days before a game studio's big release, the build system prints one line, "cycle detected in dependency graph", and stops. Somewhere among 11,000 pieces, three teams' harmless-looking changes have tied a knot. Part seven of The Deep End's algorithms series follows the build engineer who finds it, and explains the graph searches underneath: depth-first search from Trémaux's 19th-century maze method, breadth-first search from Bell Labs' telephone and circuit-board routing, topological sorting in every build tool since make, and strongly connected components, which turned out to show that…