Directed Acyclic Graph (DAG)
By CoinGecko | Updated on Mar 03, 2020
Directed acyclic graphs refers to a data structure that is built in one single direction, yet branches out and never repeats.
Directed = Connections between two points (nodes) have directions such that A -> B is not the same as B -> A.
Acyclic = Opposite of cyclic where you’ll end up where you started from after some time. In an acyclic system, you’ll never encounter the same point (node) twice.
Graphs = A structure consisting of points (nodes) that are connected.
Compared to a regular blockchain data structure which operates in one straight chain, DAG based systems have more breadth as the network is similar to a expanding tree rather than a straight chain.
Related Terms
Limit Order / Limit Buy / Limit Sell
Orders placed by traders to buy or sell a cryptocurrency when a certain price is reached
Seed
A value used to initiate generation of pseudorandom number, ususally a string of 12 commen English words.
Block Explorer
Application or websites which display information such as status of transactions or data contained in a block of a given public blockchain network.
Wei
The smallest fraction of an Ether, with each Ether to 1000000000000000000 Wei.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.