Isn't it the same wisdom as to avoid cyclic dependencies?
It is not only that. An acyclic graph can be non-planar, which means that as you add more nodes, the number of edges can grow as O(n^2).
A polytree is a planar graph, and the number of edges must grow linearly with the number of edges.
alt Hacker News
It is not only that. An acyclic graph can be non-planar, which means that as you add more nodes, the number of edges can grow as O(n^2).
A polytree is a planar graph, and the number of edges must grow linearly with the number of edges.