Description
Provides tools for directed acyclic graphs in Haskell. DAGs model items with one-way dependencies where cycles are not allowed, such as build steps or ordering constraints.
It is useful for dependency sorting, task planning, package graphs, pipelines, and analysis tools. Applications should still decide how to report cycles or invalid input when real-world data breaks the DAG assumption.