| Description: |
chooses different graph layout algorithms Possibilities are maxdepth,
mindepth, maxdepthslow, mindepthslow, maxdegree, mindegree, maxindegree, minindegree, maxoutdegree, minoutdegree, minbackward,
dfs and tree. The default algorithm tries to give all edges the same orientation and is based on the calculation of strongly
connected components. The algorithms that are based on depth first search are faster. While the simple dfs does not enforce
additionally constraints, the algorithm maxdepth tries to increase the depth of the layout and the algorithm mindepth tries
to increase the wide of the layout. These algorithms are fast heuristics. If they are not appropriate, the algorithms maxdepthslow
or mindepthslow also increase the depth or wide, but they are very slow.
The algorithm maxindegree lays out the nodes by scheduling the nodes with the maximum of incoming edges first, and minindegree
lays out the nodes by scheduling the nodes with the minimum of incoming edges first. In the same manner work the algorithms
maxoutdegree and minoutdegree for outgoing edges, and maxdegree and mindegree for the sum of incoming and outgoing edges.
These algorithms may have various effects, and can sometimes be used as replacements of maxdepthslow or mindepthslow.
The algorithm minbackward can be used if the graph is acyclic.
The algorithm tree is a specialized method for downward laid out trees. It is much faster on such tree-like graphs and results
in a balanced layout.
|
| Values: |
tree, maxdepth, mindepth, maxdepthslow, mindepthslow, maxdegree, mindegree, maxindegree, minindegree, maxoutdegree, minoutdegree, minbackward, dfs |