Directed Acyclic Graph (DAG)

Door CoinGecko | Bijgewerkt op 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.

Deel dit met een vriend.

Gerelateerde termen

Non-custodial
It is a decentralized type-of-wallet, where the users owns its private keys.
Soft cap
Targeted fund raising limit of an ICO
Private Keys
The alphanumeric string which allows transactions from the cryptocurrency address
Zero Confirmation Transaction
Another name for "unconfirmed transaction"
Wilt u uw kennis verbreden?
Ga terug naar de woordenlijst of abonneer u op onze nieuwsbrief.
coingecko (thumbnail mini)
CoinGecko voor iOS
coingecko (thumbnail mini)
CoinGecko voor Android