DAG

A graph data structure that organizes nodes and directed edges without forming any closed loops (cycles), ensuring a clear, one-way flow for dependency management and parallel processing.

DAG (Directed Acyclic Graph) is a fundamental data structure: it consists of vertices (nodes) and directed edges, structured so you can never return to a starting point. This acyclic property is critical for establishing a definitive, non-circular order of operations. We leverage DAGs extensively in workflow orchestration tools like Apache Airflow, where tasks are nodes and dependencies are edges, ensuring tasks execute in the correct sequence. In Distributed Ledger Technology (DLT), platforms such as IOTA and Hedera Hashgraph use a DAG structure, often called a 'Tangle,' to validate transactions in parallel. This concurrent processing bypasses the linear bottleneck of traditional blockchain, delivering superior scalability and high transaction throughput, frequently in the thousands of transactions per second (TPS).

https://crypto.com/university/directed-acyclic-graph-dag