Directed Acyclic Graph

  • Formal
  • A directed acyclic graph (DAG) is a directed graph data structure that uses a topological ordering. The sequence can only go from earlier to later. Its main application is an alternative to the Blockchain protocol, provided by IOTA and marketed as the Tangle.
  • Practical
  • DAG is often applied to problems related to data processing, scheduling, finding the best route in navigation, and data compression. In DLT, DAG can be used for applications that require scalability in the thousands of transactions per second as it does not require miners, it is feeless, and transactions are confirmed much quicker than Blockchain.

联系我们

欢迎与我们交流!

* Required
* Required
* Required
* Invalid email address
提交此表单,即表示您同意 Asia Growth Partners 可以与您联系并分享洞察和营销信息。
不,谢谢,我不想收到来自 Asia Growth Partners 的任何营销电子邮件。
提交

Thank you for your message!
We will contact you soon.