5 Graph Description Language (GDL) - Absint

Figure 21: Example 10, maxdepth; and mindegree layout with finetuning
• mindepth, finetuning: yes
Compared to the previous layout the long edge 8–>Start is eliminated. The algorithms dfs,
mindepth, minindegree, maxoutdegree and maxdegree happen to result in the same layout
(see right of Figure 19).
• maxdepthslow, finetuning: no
This depth six layout is in fact of maximum depth as compared to all the other variants (see
left of Figure 22).
• maxdepthslow, finetuning: yes
The fine-tuning phase eliminates the long edge Start–>6. Thus, the layout is no longer of
maximum depth. Fine-tuning may destroy the maximum depth property (see right of Figure
22).
Figure 22: Example 10, maxdepthslow layout, with and without finetuning
• mindepthslow, finetuning: no
Graphs that are of minimum depth tend to have many nodes at the top level. Compared to
57