graph/dag_scheduler_utils library

DAG-based task scheduler (topological + priorities) — roadmap #558.

Functions

dagSchedule(Adjacency graph, [int priority(int)?]) → List<int>

Returns a schedule (list of node indices) respecting topology; among nodes that are simultaneously ready (all dependencies done), priority lower = earlier. Returns an empty list when graph has a cycle.