Tag
topological-order
- Sep 25, 2026 Topological Readiness in Workflow Dependency Graphs How a scheduler decides which task may start, why the dependency edge carries ordering rather than data, and what the critical path bounds. data engineering
- Jul 5, 2026 Recurrences as DAGs: Why Optimal Substructure Makes Tables Work How a recurrence defines a graph of states, why overlapping subproblems collapse an exponential recursion tree into a polynomial one, and where the optimal-substructure argument fails. algorithms
- Mar 17, 2025 Resource Graphs and Dependency Ordering How references between resources become directed edges, why a cycle is rejected before anything is created, and how ordering decisions change apply time and blast radius. cloud infrastructure
- Feb 3, 2025 Sequencing a Cutover Against a Dependency Graph Why the ordering of moves is constrained by who calls whom, how to find a valid sequence, and what happens when the graph contains a cycle. cloud infrastructure
- Oct 20, 2024 Memoization Mechanics: Cache Keys, Laziness, and Recursion Depth How top-down memoization turns a recursion tree into a DAG, what the cache key must contain to be sound, and why the lazy traversal sometimes loses to a full table. algorithms
- Apr 1, 2024 Computational Graphs as an Intermediate Representation Why a model compiles to a list of pure value-producing nodes, how topological order doubles as the schedule, and which properties of a program a graph cannot express. inference systems