Stacks
1 tested networkx integration recipe. Exact pinned versions and a last-passed receipt, last run 2026-10-15.
Build a directed dependency graph, topologically order it, detect cycles with find_cycle, and pick shortest routes while keeping weighted Dijkstra vs hop-count BFS straight.
