5 Graph Description Language (GDL) - Absint

• invisible
Type: integer
Default value: no default value
Attribute of: top-level graph
Description:
This attribute is a synonym for the graph attribute hidden (p. 73).
• late_edge_labels
Type: yes, no
Default value: no
Attribute of: top-level graph, subgraphs
Description:
This attribute controls the moment when edge labels are drawn.
– yes
The graph is first partitioned and then edge labels are introduced.
– no
In this case the algorithm first creates labels and then partitions the graph. This option
yields a more compact layout, but may result in more crossings.
• layoutalgorithm
Type: normal, maxdepth, mindepth, ...
Default value: normal
Attribute of: top-level graph, subgraphs
Description:
This attribute specifies the basic layout algorithms, there being two main categories. The first
fourteen algorithms describe variations of a hierarchical layout, whereas the last algorithm
implements a force-directed layout. The variations differ in the way nodes are selected for
the various levels in the hierarchical layout.
– normal
This algorithm is the default algorithm. It tries to give all edges the same orientation
and is based on the calculation of strongly connected components. The algorithms
based on depth first search are faster.
– dfs
This algorithm uses a depth first search for layout calculation, but does not enforce
additional constraints pertaining to the degree of nodes. It is faster than the normal
layout algorithm. The result is heavily dependent on the initial order of the nodes in
the specification.
– maxdepth/mindepth
These two algorithms are based on depth first search and are both fast heuristics.
maxdepth tries to increase the depth of the layout. mindepth tries to increase the width
of the layout.
– maxdepthslow/mindepthslow
These slower algorithms might be better if the fast heuristics offered by the algorithms
76