Changes for page KLay Layered Layout Options

Last modified by Richard Kreissig on 2023/09/14 10:20

From version < 38.1 >

edited by cds
on 2015/02/18 15:15

To version < 40.1 >

edited by cds
on 2015/02/18 15:20

Change comment: There is no comment for this version

Raw
Rendered

Summary

Page properties (1 modified, 0 added, 0 removed)
Objects (1 modified, 0 added, 0 removed)
- Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Content

@@ -763,97 +763,65 @@
  This section explains every layout option in more detail. See [[the KIML documentation>>doc:KIML Layout Options]] for more information on KIML layout options. Those options are only mentioned here if KLay Layered adds some custom behavior.
--== Add Unnecessary Bendpoints ==
++==  ==
--{{id name="addUnnecessaryBendpoints"/}}
++{{id name="addUnnecessaryBendpoints"/}}Add Unnecessary BendpointsBy default, KLay Layered tries not to add bendpoints to an edge at positions where the edge doesn't change direction since there's no real bend there. Turning this option on forces such bend points. More specifically, a bend point is added for each edge that spans more than one layer at the point where it crosses a layer. If hierarchy layout is turned on, a bend point is also added whenever the edge crosses a hierarchy boundary.
--
++==  ==
--By default, KLay Layered tries not to add bendpoints to an edge at positions where the edge doesn't change direction since there's no real bend there. Turning this option on forces such bend points. More specifically, a bend point is added for each edge that spans more than one layer at the point where it crosses a layer. If hierarchy layout is turned on, a bend point is also added whenever the edge crosses a hierarchy boundary.
++{{id name="contentAlignment"/}}Content AlignmentDetermines how the content of compound nodes is to be aligned if the compound node's size exceeds the bounding box of the content (i.e. child nodes). This might be the case if for a compound node the size constraint of {{code language="none"}}MINIMUM_SIZE{{/code}} is set and the minimum width and height are set large enough.
--== Content Alignment ==
--
--{{id name="contentAlignment"/}}
--
--
--
--Determines how the content of compound nodes is to be aligned if the compound node's size exceeds the bounding box of the content (i.e. child nodes). This might be the case if for a compound node the size constraint of {{code language="none"}}MINIMUM_SIZE{{/code}} is set and the minimum width and height are set large enough.
--
  {{note}}
  This option is not tested for external ports with port constraints {{code language="none"}}FIXED_RATIO{{/code}} or {{code language="none"}}FIXED_POS{{/code}}.
  {{/note}}
--== Crossing Minimization ==
++==  ==
--{{id name="crossingMinimization"/}}
++{{id name="crossingMinimization"/}}Crossing MinimizationCrossing minimization determines the ordering of nodes in each layer, which influences the number of edge crossings. This option switches between one of several algorithms that can be used to minimize crossings. Possible values are:
--
--
--Crossing minimization determines the ordering of nodes in each layer, which influences the number of edge crossings. This option switches between one of several algorithms that can be used to minimize crossings. Possible values are:
--
--* LAYER_SWEEP
++* {{code language="none"}}LAYER_SWEEP{{/code}}
  The layer sweep algorithm iterates multiple times over the layers, trying to find node orderings that minimize the number of crossings. The algorithm uses randomization to increase the odds of finding a good result. To improve its results, consider increasing the //Thoroughness// option, which influences the number of iterations done. The //Randomization// seed also influences results.
--* INTERACTIVE
++* {{code language="none"}}INTERACTIVE{{/code}}
  Orders the nodes of each layer by comparing their positions before the layout algorithm was started. The idea is that the relative 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 layer sweep algorithm uses the //Interactive Reference Point// option to determine which reference point of nodes are used to compare positions.
--== Cycle Breaking ==
++==  ==
--{{id name="cycleBreaking"/}}
++{{id name="cycleBreaking"/}}Cycle BreakingKLay Layered tries to position nodes in a way that all edges point rightwards. This is not possible if the input graph has cycles. Such cycles have to be broken by reversing as few edges as possible. The reversed edges end up pointing leftwards in the resulting diagram. There are different cycle breaking algorithms available:
--
--
--KLay Layered tries to position nodes in a way that all edges point rightwards. This is not possible if the input graph has cycles. Such cycles have to be broken by reversing as few edges as possible. The reversed edges end up pointing leftwards in the resulting diagram. There are different cycle breaking algorithms available:
--
--* GREEDY
++* {{code language="none"}}GREEDY{{/code}}
  This algorithm reverses edges greedily. The algorithm tries to avoid edges that have the //Priority// property set.
--* INTERACTIVE
++* {{code language="none"}}INTERACTIVE{{/code}}
  The interactive algorithm tries to reverse edges that already pointed leftwards in the input graph. This requires node and port coordinates to have been set to sensible values.
--== Direction ==
++==  ==
--{{id name="direction"/}}
++{{id name="direction"/}}DirectionThe layout direction influences where the majority of edges in the final layout will point to. With data flow diagrams, this will usually be to the right. With control flow diagrams, it might be downwards. The layout direction defaults to {{code language="none"}}UNDEFINED{{/code}}. This causes KLay Layered to calculate a layout direction based on the {{code language="none"}}ASPECT_RATIO{{/code}} setting. As of now, if the aspect ratio is >=1 (that is, if the diagram should be wider than it is high), the direction is set to {{code language="none"}}RIGHT{{/code}}. Otherwise, it is set to {{code language="none"}}DOWN{{/code}}.
--
++==  ==
--The layout direction influences where the majority of edges in the final layout will point to. With data flow diagrams, this will usually be to the right. With control flow diagrams, it might be downwards. The layout direction defaults to {{code language="none"}}UNDEFINED{{/code}}. This causes KLay Layered to calculate a layout direction based on the {{code language="none"}}ASPECT_RATIO{{/code}} setting. As of now, if the aspect ratio is >=1 (that is, if the diagram should be wider than it is high), the direction is set to {{code language="none"}}RIGHT{{/code}}. Otherwise, it is set to {{code language="none"}}DOWN{{/code}}.
++{{id name="edgeSpacingFactor"/}}Edge Spacing FactorThe edge spacing factor determines the amount of space between edges, relative to the regular //Spacing// value. The idea is that we don't need as much space between edges as we do between nodes.
--== Edge Spacing Factor ==
--
--{{id name="edgeSpacingFactor"/}}
--
--
--
--The edge spacing factor determines the amount of space between edges, relative to the regular //Spacing// value. The idea is that we don't need as much space between edges as we do between nodes.
--
  [[image:attach:edgeSpacingFactor.png]]
--== Edge Label Side Selection ==
++==  ==
--{{id name="edgeLabelSideSelection"/}}
++{{id name="edgeLabelSideSelection"/}}Edge Label Side SelectionDetermines how KLay Layered places edge labels. The following strategies are available:
--
--
--Determines how KLay Layered places edge labels. The following strategies are available:
--
--* ALWAYS_UP
++* {{code language="none"}}ALWAYS_UP{{/code}}
  Always places edge labels above the edge.
--* ALWAYS_DOWN
++* {{code language="none"}}ALWAYS_DOWN{{/code}}
  Always places edge labels below the edge.
--* DIRECTION_UP
++* {{code language="none"}}DIRECTION_UP{{/code}}
  Places edge labels above edges pointing right, and below edges pointing left.
--* DIRECTION_DOWN
++* {{code language="none"}}DIRECTION_DOWN{{/code}}
  Places edge labels below edges pointing right, and above edges pointing left.
--* SMART
++* {{code language="none"}}SMART{{/code}}
  Uses a heuristic that determines the best edge label placement, also taking the placement of port labels into account.
--== Feedback Edges ==
++==  ==
--{{id name="feedbackEdges"/}}
++{{id name="feedbackEdges"/}}Feedback EdgesFeedback edges are edges that feed the output of a node back to be the input of a previous node. This option controls how feedback edges are routed if port constraints are FREE. This influences how much emphasis is put on feedback edges.
--
--
--Feedback edges are edges that feed the output of a node back to be the input of a previous node. This option controls how feedback edges are routed if port constraints are FREE. This influences how much emphasis is put on feedback edges.
--
  With feedback edges:
  [[image:attach:feedback_on.png]]
@@ -862,37 +862,25 @@
  [[image:attach:feedback_off.png]]
--== Fixed Alignment ==
++==  ==
--{{id name="fixedAlignment"/}}
++{{id name="fixedAlignment"/}}Fixed AlignmentThe {{code language="none"}}BRANDES_KOEPF{{/code}} node placement algorithm computes several different node placements. One of the placements is chosen by the algorithm, usually the one that takes the least amount of space. With this option, a particular result can be chosen.
--
--
--The BRANDES_KOEPF node placement algorithm computes several different node placements. One of the placements is chosen by the algorithm, usually the one that takes the least amount of space. With this option, a particular result can be chosen.
--
  This option should usually be left alone.
--== Interactive Reference Point ==
++==  ==
--{{id name="interactiveReferencePoint"/}}
++{{id name="interactiveReferencePoint"/}}Interactive Reference PointInteractive layering, crossing minimization, and cycle breaking algorithms use node positions to sort nodes into layers or to determine the order of nodes in each layer. However, it is unclear if for example the top left corners of nodes should be compared, or the bottom left corners — different settings might lead to different results. The interactive reference point determines which part of nodes is used to compare their positions. It provides the following settings:
--
--
--Interactive layering, crossing minimization, and cycle breaking algorithms use node positions to sort nodes into layers or to determine the order of nodes in each layer. However, it is unclear if for example the top left corners of nodes should be compared, or the bottom left corners — different settings might lead to different results. The interactive reference point determines which part of nodes is used to compare their positions. It provides the following settings:
--
--* TOP_LEFT
++* {{code language="none"}}TOP_LEFT{{/code}}
  The top left corner of a node is taken as the reference point.
--* CENTER
++* {{code language="none"}}CENTER{{/code}}
  The center of a node is taken as the reference point.
--== Layer Constraint ==
++==  ==
--{{id name="layerConstraint"/}}
++{{id name="layerConstraint"/}}Layer ConstraintThe layer a node is placed in is usually computed by the layer assignment algorithms. However, sometimes certain nodes need to be placed in the first or in the last layer (for example, nodes that represent inputs from the outside). The layer constraint option can be set on such nodes to do just that.
--
--
--The layer a node is placed in is usually computed by the layer assignment algorithms. However, sometimes certain nodes need to be placed in the first or in the last layer (for example, nodes that represent inputs from the outside). The layer constraint option can be set on such nodes to do just that.
--
  [[image:attach:layer_constraints.png]]
  {{note}}
@@ -899,12 +899,10 @@
  This option can also be set to {{code language="none"}}FIRST_SEPARATE{{/code}} and {{code language="none"}}LAST_SEPARATE{{/code}}. These are for internal use only and should not have been publicly exposed in the first place. Using them can result in layout problems.
  {{/note}}
--== Linear Segments Deflection Dampening ==
++==  ==
--{{id name="deflectionDampening"/}}
++{{id name="deflectionDampening"/}}Linear Segments Deflection Dampening
--
--
  {{note}}
  This is a very advanced layout option that you normally shouldn't worry about.
  {{/note}}
@@ -911,57 +911,37 @@
  The linear segments node placer can sometimes place nodes in a way that results in unnecessarily large diagrams. This option dampens how much the nodes are moved around. A dampening factor of 1.0 disables dampening and just lets the node placer do what it wants. A more conservative dampening factor of 0.3 (the default) restricts the freedom of the node placer a bit more.
--== Maximal Iterations ==
++==  ==
--{{id name="maximalIterations"/}}
++{{id name="maximalIterations"/}}Maximal IterationsDelimits the amount of depth-first-search iterations performed by the network simplex layering strategy. Large, highly connected graphs might require a long time to be processed. This property serves as a timeout after which an exception is raised.
--
++==  ==
--Delimits the amount of depth-first-search iterations performed by the network simplex layering strategy. Large, highly connected graphs might require a long time to be processed. This property serves as a timeout after which an exception is raised.
++{{id name="mergeEdges"/}}Merge EdgesIn the KGraph model, edges can either connect to nodes through ports or directly. In the latter case, KLay Layered will introduce a virtual port for each edge, which results in all edges connecting to the node at different points in the final drawing. If this option is switched on, KLay Layered will only generate up to one input and one output port for each node. The option is set on a parent node and applies to all of its children, but not to the parent node itself.
--== Merge Edges ==
--
--{{id name="mergeEdges"/}}
--
--
--
--In the KGraph model, edges can either connect to nodes through ports or directly. In the latter case, KLay Layered will introduce a virtual port for each edge, which results in all edges connecting to the node at different points in the final drawing. If this option is switched on, KLay Layered will only generate up to one input and one output port for each node. The option is set on a parent node and applies to all of its children, but not to the parent node itself.
--
  [[image:attach:merging.png]]
--== Merge Hierarchy-Crossing Edges ==
++==  ==
--{{id name="mergeHierarchyEdges"/}}
++{{id name="mergeHierarchyEdges"/}}Merge Hierarchy-Crossing EdgesIf hierarchical layout is active, this option is the hierarchical equivalent to //Merge Edges//. If set to true on a compound node, all hierarchy-crossing edges that start or end inside that compound node are eligible for merging.
--
--
--If hierarchical layout is active, this option is the hierarchical equivalent to //Merge Edges//. If set to true on a compound node, all hierarchy-crossing edges that start or end inside that compound node are eligible for merging.
--
  [[image:attach:merge_hierarchy_edges.png]]
--== Node Layering ==
++==  ==
--{{id name="nodeLayering"/}}
++{{id name="nodeLayering"/}}Node LayeringDecides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
--
--
--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
++* {{code language="none"}}NETWORK_SIMPLEX{{/code}}
  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>>doc:||anchor="maximalInterations"]] option.
--* LONGEST_PATH
++* {{code language="none"}}LONGEST_PATH{{/code}}
  A very simple algorithm that distributes nodes along their longest path to a sink node.
--* INTERACTIVE
++* {{code language="none"}}INTERACTIVE{{/code}}
  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 ==
++==  ==
--{{id name="nodePlacement"/}}
++{{id name="nodePlacement"/}}Node PlacementDecides which algorithm is used to compute the y coordinate of each node. This influences the length of edges, the number of edge bends, and the height of the diagram. We have different algorithms available, with different optimization goals:
--
--
--Decides which algorithm is used to compute the y coordinate of each node. This influences the length of edges, the number of edge bends, and the height of the diagram. We have different algorithms available, with different optimization goals:
--
  * {{code language="none"}}BRANDES_KOEPF{{/code}}
  Minimizes the number of edge bends at the expense of diagram size: diagrams drawn with this algorithm are usually higher than diagrams drawn with other algorithms.
  * {{code language="none"}}LINEAR_SEGMENTS{{/code}}
@@ -973,10 +973,6 @@
  * {{code language="none"}}SIMPLE{{/code}}
  Minimizes the area at the expense of... well, pretty much everything else.
--== Thoroughness ==
++==  ==
--{{id name="thoroughness"/}}
--
--
--
--There are heuristics in use all over KLay Layered whose results often improve with the number of iterations computed. The thoroughness is a measure for telling KLay Layered to compute more iterations to improve the quality of results, at the expense of performance.
++{{id name="thoroughness"/}}ThoroughnessThere are heuristics in use all over KLay Layered whose results often improve with the number of iterations computed. The thoroughness is a measure for telling KLay Layered to compute more iterations to improve the quality of results, at the expense of performance.

Confluence.Code.ConfluencePageClass[0]

Id

@@ -1,1 +1,1 @@
--10751225
++12288527

URL

@@ -1,1 +1,1 @@
--https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/10751225/KLay Layered Layout Options
++https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/12288527/KLay Layered Layout Options

Changes for page KLay Layered Layout Options

Summary

Details

Navigation

Quick Links