News for hackers. Stuff that matters.
Re:Data-oriented design or why you might shoot yourself in t... by jholman on Tuesday June 29, 2021 @08:49PM (#27683672)
> any two vertices are connected by (i.e. are the endpoints of) exactly one path

No.

You just described a connected acyclic graph, not a tree.

In addition to being connected and acyclic, a tree must also have a root, and is thus implicitly directed.

There are no comments on this comment yet.