Tag
directed-acyclic-graphs
- 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
- May 7, 2025 Build Graph Construction and Topological Ordering How a build system turns declared targets and prerequisites into a directed acyclic graph, how cycles are detected, and why the order a build actually runs in is not the topological order. developer tools