Do you mean connections to siblings? I'd assume that siblings and cousins would be identified by their position in the hierarchy and not necessarily by an edge between them. Definitely, having this edge between two…
interesting observation. Do you have an example of this? I think that hierarchical algorithms tend to try to find a flow of edges and build from there. For example, package dependencies.
There is this open book https://cs.brown.edu/people/rtamassi/gdhandbook/ We've drawn some inspiration from there and followed to some references too
You might want to give a try to https://terrastruct.com/
Do you mean connections to siblings? I'd assume that siblings and cousins would be identified by their position in the hierarchy and not necessarily by an edge between them. Definitely, having this edge between two…
interesting observation. Do you have an example of this? I think that hierarchical algorithms tend to try to find a flow of edges and build from there. For example, package dependencies.
There is this open book https://cs.brown.edu/people/rtamassi/gdhandbook/ We've drawn some inspiration from there and followed to some references too
You might want to give a try to https://terrastruct.com/