# DIDO Wiki

### Sidebar

dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag

## Directed Acyclic Graph (DAG)

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 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.1)
1)
“What is DAG Distributed Ledger Technology?”, Max Thake, 9 November 2018, https://medium.com/nakamo-to/what-is-dag-distributed-ledger-technology-8b182a858e19
dido/public/ra/xapend/xapend.a_glossary/d/directed_acyclic_graph_dag.txt · Last modified: 2021/10/04 13:40 by 50.19.247.197
Translations of this page: