Resolve job dependencies into an execution order (Kahn's algorithm). Throws if
the graph has a cycle. Ports pkg/queue.TopologicalSort — including its stable
seeding of the ready set in job-declaration order, so the order is
deterministic across runs.
Resolve job dependencies into an execution order (Kahn's algorithm). Throws if the graph has a cycle. Ports pkg/queue.TopologicalSort — including its stable seeding of the ready set in job-declaration order, so the order is deterministic across runs.