ejuliobatista2

4 ms·

1. 1.▲
   by ejuliobatista2 4y ago

   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 nodes at the same le
2. 2.▲
   by ejuliobatista2 4y ago

   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.
3. 3.▲
   by ejuliobatista2 4y ago

   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
4. 4.▲
   by ejuliobatista2 5y ago

   You might want to give a try to https://terrastruct.com/