5 Graph Description Language (GDL) - Absint

all untuned graphs, this layout is of minimum depth. It should be noted, however, that the
algorithm mindepth with fine-tuning is able to produce a flatter layout (see left of Figure 23).
• mindepthslow, finetuning: yes
Compared to the previous layout, the long edge 8–>Start is balanced again (see right of
Figure 23).
Figure 23: Example 10, mindepthslow layout, with and without finetuning
• maxindegree, finetuning: no
Here node 3 is placed at the level zero because it has the maximum indegree. Node 0 is not
chosen for level zero because it doesn’t have any outgoing edges (see left of Figure 24).
• maxindegree, finetuning: yes
Once again the long edge 8–>Start of the previous algorithm is eliminated by balancing the
position of node 8. The algorithms dfs, mindepth and minindegree happen to result in the
same layout (see right of Figure 24).
Figure 24: Example 10, maxindegree layout, with and without finetuning
• minindegree, finetuning: no
The layout algorithms dfs, mindepth, minindegree, maxoutdegree and maxdegree happen to
result in the same layout (see left of Figure 19).
• minindegree, finetuning: yes
The algorithms dfs, mindepth, minindegree, maxoutdegree and maxdegree happen to result
in the same layout (see right of Figure 19).
58