5 Graph Description Language (GDL) - Absint
5 Graph Description Language (GDL) - Absint
5 Graph Description Language (GDL) - Absint
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
B in the message window (see p. 120). Next, the iterations for the crossing reduction can be<br />
limited (-cmax option, cmax attribute) or another crossing weight selected (-bary option, etc.,<br />
crossing_weight attribute). Normally, it is not necessary to switch off local crossing optimization,<br />
because this step is quite fast and effective.<br />
If the graph is very unbalanced, the pendulum method may require considerable time (indicated by<br />
m in the message window). In this case, the number of iterations for the crossing reduction should<br />
be limited (-pmax option, pmax attribute). If the straight-line fine-tuning phase takes too long<br />
(indicated by S in the message window), its maximum iteration number should be limited (-smax<br />
option, smax attribute).<br />
Other parameters usually needn’t be changed, because the corresponding phases are quite fast.<br />
Bending reduction in particular improves layout quality greatly and is so fast that the -bending<br />
option is hardly needed.<br />
Fast mode (-fast option) drastically reduces all iteration limits and may result in poor layout<br />
quality.<br />
The drawing of splines is slow, consequently it should be avoided on large graphs.<br />
It is also possible to set a time limit (-timelimit option). If the time limit is exceeded, the<br />
fastest possible mode for the current and the following iteration phases is selected. Selecting a<br />
time limit does not mean that the layout has actually finished when the time has elapsed: Layout<br />
may be faster if the graph is small and/or its structure is simple. It may be much slower, because<br />
even the fastest possible methods may take some time. The time limit is real time, thus the result<br />
of the layout may depend on the load of the computer. Thus, given a time limit, two identical trials<br />
needn’t result in identical layouts.<br />
41