DAG-specific algorithms that leverage acyclicity guarantees.

These algorithms are optimized for DAGs and would be incorrect or inefficient on general graphs with cycles. The DAG property enables linear-time solutions for problems that are NP-hard on general graphs.

The 'internal' constructor allows the Model and Algorithms modules to create Dags, but prevents external users from bypassing the guard.

Error indicating a cycle was detected during DAG construction.

Direction for reachability analysis.

Directed Acyclic Graph (DAG) type and operations.

A DAG is a directed graph with no cycles. This module provides a type-safe wrapper around Graph that guarantees acyclicity through construction, enabling total functions for operations that would be partial on general graphs.