===== Directed Acyclic Graph (DAG) =====
[[dido:public:ra:xapend:xapend.a_glossary:start| Return to Glossary ]]

**Directed Acyclic Graph (DAG)** mathematically a DAG is a graph that travels in one direction without cycles connecting the other edges. This means it is impossible to traverse the entire graph starting at one edge. The edges of the directed graph only go one way. The graph is a topological sorting, where each [[dido:public:ra:xapend:xapend.a_glossary:n:node|node]] is in a certain order.

Imagine a collection of individual transactions where each transaction is linked to at least one other transaction in the following way:

  : **Directed**
    : The links point in the same direction with earlier transactions linked to later transactions, and so on.
  : **Acyclic**
    : Loops are not possible. A transaction cannot loop back on itself after linking to another transaction.
  : **Graph**
    : The mesh of connected transactions can be represented as nodes in a graph network, in which nodes are joined to each other by links.((
"What is DAG Distributed Ledger Technology?", Max Thake, 9 November 2018,
[[https://medium.com/nakamo-to/what-is-dag-distributed-ledger-technology-8b182a858e19]]
))