Tag
depth-first-search
- Oct 9, 2026 Topological Order From Finish Times and Why the Reverse Is the Answer The finish-time argument that makes reverse post-order a valid topological sort, why the reverse prefix order is not, and how cycle detection folds into the same traversal. algorithms
- Apr 18, 2026 Iterative Depth-First Search Without Losing Finish Times Why a stack of vertices does not reproduce recursive DFS, how to keep an explicit frame with a resume index, and what changes when the traversal can be paused and resumed. algorithms
- May 17, 2025 Discovery and Finish Times: What DFS Edge Classification Encodes How the two timestamps recorded by depth-first search partition a directed graph into tree, back, forward, and cross edges, and why undirected graphs admit only two of those classes. algorithms
- Feb 19, 2025 Lowlink Values: How One DFS Pass Finds Strongly Connected Components Why the minimum reachable discovery index identifies component roots, why edges to finished components must be ignored, and how the output order relates to the condensation. algorithms