Tag: graph-algorithms
-
Recursive DFS vs Iterative Stack: Cycle Detection Performance and Limits
Recursive DFS is 30% faster but crashes at 10K nodes. Iterative survives 50K graphs โ here's the stack overhead breakdown and when each wins.
-
Topological Sort: From Task Scheduling to Build Systems
Topological sort powers build systems and package managers. Kahn's vs DFS algorithms compared with real dependency graphs and failure modes.