5 Graph Description Language (GDL) - Absint

11 edge: { source: "0" target: "4" }
12 edge: { source: "0" target: "5" }
13 edge: { source: "0" target: "9" }
14 edge: { source: "1" target: "3" }
15 edge: { source: "2" target: "4" }
16 edge: { source: "3" target: "5" }
17 edge: { source: "5" target: "0" }
18 edge: { source: "9" target: "0" }
19 edge: { source: "0" target: "6" }
20 edge: { source: "6" target: "7" }
21 edge: { source: "7" target: "8" }
22 edge: { source: "8" target: "0" }
23 }
Here follows a discussion of all the different hierarchical layout algorithms with and without finetuning
for this example.
• normal, finetuning: no
The normal layout algorithm breaks the cycle so that only one reverted edge is necessary
(see left of Figure 18).
• normal, finetuning: yes
Compared to the previous layout, the fine-tuning phase has balanced the position of the node
9. The long edge 8–>Start is not balanced since this would create additional reverted edges
(see right of Figure 18).
Figure 18: Example 10, normal layout, with and without finetuning
• dfs, finetuning: no
The layout algorithms dfs, mindepth, minindegree, maxoutdegree and maxdegree happen to
result in the same layout (see left of Figure 19).
• dfs, finetuning: yes
The algorithms dfs, mindepth, minindegree, maxoutdegree and maxdegree happen to result
in the same layout (see right of Figure 19).
55