February 2019
Intermediate to advanced
450 pages
9h 59m
English
Directive Acrylic Graphs (DAGs), as its name suggests, are graphs in which each vertex (or node) can have edges pointing to other vertexes, as shown in the following diagram:

The direction of the arrow does not matter, as long as you make it consistent:

The rule is that these edges should not make a cycle. In the following figure, we can see that vertexes A, C, and D make a cycle, which is against the rules of a DAG:
Now, if you combine a Merkle tree and DAG, you get a Merkle DAG. This is the data structure ...