☝️ That's my test compound graph. So, before I can assign ranks (vertical positions) I need to compute a couple of intermediate structures.
The "nesting tree" for the hierarchy of the graph. Which also gives me the depth information for each node and sub-graph. ✅ Done.
The "nesting tree" for the hierarchy of the graph. Which also gives me the depth information for each node and sub-graph. ✅ Done.
Comments
(image generated with graphviz)
After that:
- split edges that span more than one rank (by adding dummy nodes)
- edge cross reduction between ranks
- position nodes/edges
- render
We'll see. 😵💫