Owner's Manual

682 Topology Views
Layout
- Direction –Select whether you want the hierarchy Top to bottom, Bottom to top, Left to right or
Right to left with the pick list.
-
Fit to Bounds –The items on this pick list configure how the hierarchy fits within the bounds of
the screen displayed:
Never, Always, or As Needed . Check Keep Ratio or Resize Nodes to
activate these.
-
Straighten Links when– Select from the pick list: Never (the default) , No Nodes (creates straight
links when no node obstacles exist)
, No Links (creates straight links when no link obstacles
exist)
, No Nodes nor Links (creates straight links when no node or link obstacles exist) , or
Always.
- Components Spacing –The number of pixels between components.
-
Node Placement –Select from the pick list: Rubber (assigns positions to nodes and links as if
they are attached to a rubber band)
, or Basic (considers the node spacing and rank spacing
used between node centers; calculates the center of the layout by counting the maximum
rank count and placing each node relative to the center)
.
- Simplify Links –Check this to activate this algorithm.
-
Minimal Node /Edge / Rank Spacing –See the steps described immediately below Hierarchy on
page 681.
-
Variable Rank Spacing –Check this to activate it.
-
Node Alignment –Select from the pick list: Center, Leading, or Tr a i l i n g .
- Avoid Node Crossings –Check this to activate an algorithm that avoids node crossings.
-
Traversal Method –Select from the pick list: Pendulum, Top to Bottom, or Bottom to Top. See the
steps described immediately below Hierarchy on page 681.
-
Allowed Retry –Enter the number retries.
-
Max Iteration Count –Enter the number iterations.
Node Rank
- Ranking Policy –Select from the pick list ( BFS, DFS, As is, or Random )
Node Order
- Allowed Reducing Fails –Enter a number for the permitted number of failures.
-
Allowed Node Shuffle Count –Enter a number that specifies the number of times that the
display algorithm can shuffle the nodes of each rank. Node shuffling can significantly improve
the result, which allows the algorithm to find new solutions to crossing problems.
-
Traversal Method –Select from the pick list: Pendulum, Top to Bottom, or Bottom to Top.
- Weight Heuristic – Select from the pick list: Barycenter, Median or None. Barycenter and Median
are heuristics that reorder nodes in the graph and reduce crossings.