This package containers a few helper routines to help with sorting a DAG
(directed acyclic graphs) such that nodes with no inbound edges will be
returned first.
.
This is particularly useful for things like ordering tasks, and handling
dependencies.
Installed Size: 23.6 kB
Architectures: all