StyleEd Help Pages

Layout Settings

Type Layout

Package Distance

Specifies the distance between (geometrically) adjacent package nodes.

Relation Distance

Specifies the distance between the detailed type and related types.

Bus Routing

If checked, multiple generalization or realization edges are routed in bus-style, i.e. their paths will share the first edge segment.

Relation Type Distance

Specifies the distance between (geometrically) adjacent types nodes in the various relation lists.

Relation Type Alignment

Determines the horizontal alignment of type nodes in the lists of associations and dependencies.

Left
Type nodes are left aligned.
Center
Type nodes are center aligned.
Shortest Distance
Type nodes in the associations list are right aligned, type nodes in the dependencies list left aligned.

Relation Type Label Layout Policy

Determines the policy to be used for placing type name labels of related type nodes, if labels are position outside the nodes' bounding box.

As is
Do not reposition labels. (Usually, this will result in labels above a node's geometrical bounds.)
Outwards
Labels are positioned to the far side of the type node. I.e. for associations labels are positioned to the left of the type node, for dependencies to the right, and for generalizations and realizations above the type node.

Package Layout

Orientation

Determines the main layout orientation. The algorithm tries to arrange nodes in such a way that all edges point in the main layout direction.

Top to Bottom
The main layout orientation will be from top to bottom.
Bottom to Top
The main layout orientation will be from bottom to top.
Left to Right
The main layout orientation will be from left to right.
Right to Left
The main layout orientation will be from right to left.

Reverse Edges

If checked, all edge directions are reversed during layout calculation.

Route Orthogonal

If checked, edge paths will be routed in an orthogonal style, i.e. only vertical and horizontal line segments will be used. Orthogonal edge routing increases the height of the layout. If unchecked, edge paths will be routed as a polyline with a certain number of bends.

Bus Routing

If checked, multiple edges representing the same relation type and connecting to a common target node are routed in bus-style, i.e. their paths will share the last edge segment. Bus-style routing should only be used with option route orthogonal enabled as well.

Overview Layout

Orientation

Determines the main layout orientation. The algorithm tries to arrange nodes in such a way that all edges point in the main layout direction.

Top to Bottom
The main layout orientation will be from top to bottom.
Bottom to Top
The main layout orientation will be from bottom to top.
Left to Right
The main layout orientation will be from left to right.
Right to Left
The main layout orientation will be from right to left.

Reverse Edges

If checked, all edge directions are reversed during layout calculation.

Route Orthogonal

If checked, edge paths will be routed in an orthogonal style, i.e. only vertical and horizontal line segments will be used. Orthogonal edge routing increases the height of the layout. If unchecked, edge paths will be routed as a polyline with a certain number of bends.

Bus Routing

If checked, multiple edges representing the same relation type and connecting to a common target node are routed in bus-style, i.e. their paths will share the last edge segment. Bus-style routing should only be used with option route orthogonal enabled as well.

Group Compaction

If checked, nodes belonging to node group will be placed in such a way, that they occupy as little horizontal (for layout orientations Top to Bottom and Bottom to Top) or vertical (for layout orientations Left to Right and Right to Left) space as possible.

Recursive Group Layering

Determines how node groups are handled when calculating hierarchic node layers.

If checked, groups are layered recursively, i.e.

If unchecked, group information is ignored for the layering step.

Cycle Layering Policy

Determines the layering policy for nodes belonging to a cycle (i.e. a cyclic dependency path in the diagram).

Default
Cycle Nodes are assigned to layers according to the order induced by a topological sorting of the diagram.
Assign Cycle Nodes to same Layer
Cycle Nodes belonging to a common cycle are assigned to the same layer.
Break Cycles by Edge Weight
Before calculating node layers, the diagram is made acyclic by removing one of the edges with minimum weight from each cycle. The multiplicity for each dependency in the diagram is considered to be the edge weight for this purpose.

Back