Walk a directed acyclic graph in dependency order. A DAG built from edges, or from sequences, hands out the nodes whose predecessors are complete, singly or in batches, and refuses a graph with a cycle.
Required Ruby Version
>= 3
Authors
thoran
Versions
-
0.3.0
-
source
- 0.3.0 source October 25, 2026 (8.5 KB)
-
