Hacker News new | ask | show | jobs
by phailhaus 782 days ago
The author already says that:

> It is technically a directed acyclic graph (DAG)

But DAG's don't have 'roots', they just have nodes. The concept of roots makes it a tangled tree.