3 ms·
I see your point about it not being a strict tree. It is tree-like, however, in the sense that the branches/edges only point in one direction: forward in time
by garrettgarcia 1y ago
I see your point about it not being a strict tree. It is tree-like, however, in the sense that the branches/edges only point in one direction: forward in time.
- MarkusQ 1y agoBut it's a reticulating structure; yes, the graph is directed / partially ordered, but it's certainly not tree-like. The key property of real trees is that they _branch_ and the branches don't recombine.
- garrettgarcia 1y agoAu contraire: https://en.wikipedia.org/wiki/Inosculation https://en.wikipedia.org/wiki/Inosculation I do agree that branches staying separate is the essential property of a tree data structure.
- Retric 1y agoThat’s referring to a joining between different trees not the same tree. The need to connect leaves to roots is what gives individuals trees their branching nature. Obviously a tree can have holes in it etc, but loops in nutrient delivery present an inherent issue.
- aidenn0 1y agoWhich is why the article points out that it's a directed acyclic graph, not a tree.