Does Nx formally consider the ProjectGraph and TaskGraph to be Directed Acyclic Graphs (DAGs), and is that assumption enforced through code (e.g. cycle detection, topological ordering)?

[geekburton]

I'm exploring how Nx internally represents dependency structures. From the behavior of ProjectGraph and TaskGraph, including cycle detection, task ordering, and affected computation, it appears they function as Directed Acyclic Graphs (DAGs). However, I haven't found an explicit reference in the documentation or codebase confirming this. Can you clarify whether Nx formally treats these graphs as DAGs, and whether that assumption is enforced through code (e.g. cycle detection or topological sorting)? A definitive answer would help remove ambiguity for technical documentation and architectural alignment.