I've made tiny progress on the graph layout implementation, I'm following more closely the "Layout of Compound Directed Graphs" paper. Now I have the "extended nesting graph" (graph hierarchy + connections) data structure ready.
Note that for each sub-graph there is a top/bottom "border" node.
Note that for each sub-graph there is a top/bottom "border" node.
Comments
There is an easy algorithm which gives poor results. I'll start with that so I can move to the next stages of the algorithm: nodes positioning, edges routing…