Page History
...
| Anchor | ||||
|---|---|---|---|---|
|
...
Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
- NETWORK_SIMPLEX
This algorithm tries to minimize the length of edges. This is the most computationally intensive algorithm. The number of iterations after which it aborts if it hasn't found a result yet can be set with the Maximal Iterations option. - LONGEST_PATH
A very simple algorithm that distributes nodes along their longest path to a sink node. - INTERACTIVE
Distributes the nodes into layers by comparing their positions before the layout algorithm was started. The idea is that the relative horizontal order of nodes as it was before layout was applied is not changed. This of course requires valid positions for all nodes to have been set on the input graph before calling the layout algorithm. The interactive node layering algorithm uses the Interactive Reference Point option to determine which reference point of nodes are used to compare positions.
Node Placement
| Anchor | ||||
|---|---|---|---|---|
|
...
Overview
Content Tools