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.