5 Graph Description Language (GDL) - Absint

The layout algorithms minoutdegree and mindegree happen to result in the same layout (see
left of Figure 25).
• mindegree, finetuning: yes
Compared to the previous layout, the long edges Start–>1 Start–>2 and Start–>6 are
eliminated. This changes the structure of the layout entirely (see right of Figure 21).
5.6.4 Tree Layout
The following example shows a typed syntax tree. This tree can either be drawn by the specialized
algorithm for “downward laid-out trees” or by the normal algorithms. When the normal algorithms
are used to draw a tree, it is advisable to increase the layout down factor in order to obtain good
results (see Figure 26). If the layout down factor is not used, the incoming edges draw the nodes
too much in the direction of the parent node.
Figure 26: Example 11, normal layout
A nice layout is achieved by the specialized tree algorithm with a tree factor of 0.9 (see Figure 27).
If an orthogonal layout is needed, the attribute smanhattan_edges can be used. For trees, this attribute
is more appropriate than the standard Manhattan layout with manhattan_edges (see Figure
28).
60