5 Graph Description Language (GDL) - Absint

• maxoutdegree, finetuning: no
The layout algorithms dfs, mindepth, minindegree, maxoutdegree and maxdegree happen to
result in the same layout (see left of Figure 19).
• maxoutdegree, finetuning: yes
The algorithms dfs, mindepth, minindegree, maxoutdegree and maxdegree happen to result
in the same layout (see right of Figure 19).
• minoutdegree, finetuning: no
Nodes 4 and 0 with a minimum outdegree of zero cannot be start nodes because start nodes
have to have at least one successor otherwise they would create single-node components of
the spanning tree. Start nodes can be any other nodes except Start, from which 1, 2, and 6
happen to be selected (see left of Figure 25).
• minoutdegree, finetuning: yes
The long edges Start–>1, Start–>2 and Start–>6 are eliminated (see right of Figure 25).
Figure 25: Example 10, minoutdegree layout, with and without finetuning
• maxdegree, finetuning: no
The Start node has the maximum number of incoming and outgoing edges, so it is selected as
the start node of the spanning tree, i. e. it appears at the topmost level. The layout algorithms
dfs, mindepth, minindegree, maxoutdegree and maxdegree happen to result in the same
layout (see left of Figure 19).
• maxdegree, 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).
• mindegree, finetuning: no
The candidates for start nodes of the spanning tree are 1, 2, 6, 7, 8 and 9 because they have
a minimum degree of two. 1, 2 and 6 happen to be selected as the start nodes. Note that
nodes 4 and 0 are not candidates for start nodes because they do not have outgoing edges.
59