5 Graph Description Language (GDL) - Absint

maxdepth and maxdepth do not provide satisfying results. maxdepthslow tries to increase
the depth of the layout and mindepthslow the width of the layout.
– maxindegree / minindegree
maxindegree schedules nodes with a maximum of incoming edges first, i. e. these
nodes are positioned early. minindegree schedules nodes with a minimum of incoming
edges first.
– maxoutdegree / minoutdegree
maxoutdegree schedules nodes with a maximum of outgoing edges first, i. e. these
nodes are positioned early. minoutdegree schedules nodes with a minimum of outgoing
edges first.
– maxdegree / mindegree
maxoutdegree schedules nodes with a maximum of the sum of incoming and outgoing
edges first, i. e. these nodes are positioned early. The algorithm minoutdegree schedules
nodes with the minimum of the sum of incoming and outgoing edges first.
– minbackward
Instead of calculating strongly connected components, minbackward performs a topological
sorting to assign ranks to the nodes. This algorithm is fast if the graph is acyclic.
– tree
The tree algorithm is a specialized method for downward laid out (see p. 117). It is
very fast for these tree-like graphs and results in a balanced layout.
– forcedir
This layout algorithm computes a force-directed placement. It is a nonhierarchical
layout method that works well for undirected graphs. Some features of hierarchical
layout like near edges are disabled for this layout algorithm.
The layout calculation for this algorithm can be controlled via the following graph
attributes:
∗ Spring embedder forces
attraction (p. 66), repulsion (p. 82)
∗ Gravitational forces
gravity (p. 72)
∗ Simulated annealing
fdmax (p. 71),
tempmin, tempmax (p. 86),
temptreshold (p. 87), tempscheme (p. 87), tempfactor (p. 86)
∗ Random influence
randomfactor (p. 81), randomrounds (p. 82), randomimpulse (p. 82)
∗ Magnetic forces
magnetic_field1, magnetic_field2 (p. 79),
magnetic_force1, magnetic_force2 (p. 79)
∗ Energy level
energetic (p. 70)
77