Differences

This shows you the differences between two versions of the page.

--- dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag [2019/06/27 05:45]
nick created
+++ dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag [2021/10/04 13:40] (current)
50.19.247.197 ↷ Links adapted because of a move operation
@@ Line 1: / Line 1: @@
 ===== Directed Acyclic Graph (DAG) =====
-[[dido:public:glossary | Return to Glossary ]]
+[[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 node is in a certain order.
+**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:
@@ Line 15: / Line 15: @@
 [[https://medium.com/nakamo-to/what-is-dag-distributed-ledger-technology-8b182a858e19]]
 ))

DIDO Wiki