Last modified by Richard Kreissig on 2023/09/14 10:20
<
From version < 27.1 >
edited by cds
on 2014/04/03 15:03
To version < 45.1 >
edited by Alexander Schulz-Rosengarten
on 2023/07/11 10:25
>
Change comment: Renamed back-links.

Summary

Details

Page properties
Parent
... ... @@ -1,0 +1,1 @@
1 +KIELER.Home.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.WebHome
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.cds
1 +XWiki.als
Content
... ... @@ -8,11 +8,11 @@
8 8  
9 9  = Overview =
10 10  
11 -For a general introduction on layout options, see [[the KIML documentation>>doc:KIML Layout Options]]. KLay Layered supports layout options defined by KIML and defines additional custom layout options.
11 +For a general introduction on layout options, see [[the KIML documentation>>doc:Kieler.Discontinued Projects.Infrastructure for Meta Layout (KIML).KIML Layout Options.WebHome]]. KLay Layered supports layout options defined by KIML and defines additional custom layout options.
12 12  
13 13  == Supported KIML Layout Options ==
14 14  
15 -KLay Layered supports the following standard layout options defined by KIML. Note that the default value may be altered (highlighted yellow). These layout options are documented on [[KIML's Layout Options page>>doc:KIML Layout Options]].
15 +KLay Layered supports the following standard layout options defined by KIML. Note that the default value may be altered (highlighted yellow). These layout options are documented on [[KIML's Layout Options page>>doc:Kieler.Discontinued Projects.Infrastructure for Meta Layout (KIML).KIML Layout Options.WebHome]].
16 16  
17 17  |=(((
18 18  Option
... ... @@ -25,6 +25,22 @@
25 25  )))|=(((
26 26  Default
27 27  )))
28 +|(% colspan="1" %)(% colspan="1" %)
29 +(((
30 +Additional Port Space
31 +)))|(% colspan="1" %)(% colspan="1" %)
32 +(((
33 +de.cau.cs.kieler.additionalPortSpace
34 +)))|(% colspan="1" %)(% colspan="1" %)
35 +(((
36 +Margins
37 +)))|(% colspan="1" %)(% colspan="1" %)
38 +(((
39 +Nodes
40 +)))|(% colspan="1" %)(% colspan="1" %)
41 +(((
42 +0, 0, 0, 0
43 +)))
28 28  |(((
29 29  Alignment
30 30  )))|(((
... ... @@ -104,7 +104,7 @@
104 104  
105 105  )))
106 106  |(((
107 -Direction
123 +[[Direction>>doc:||anchor="direction"]]
108 108  )))|(((
109 109  de.cau.cs.kieler.direction
110 110  )))|(((
... ... @@ -111,9 +111,8 @@
111 111  Enum
112 112  )))|(((
113 113  Parents
114 -)))|(% class="highlight-yellow" data-highlight-colour="yellow" %)(% class="highlight-yellow" data-highlight-colour="yellow" %)
115 -(((
116 -RIGHT
130 +)))|(((
131 +UNDEFINED
117 117  )))
118 118  |(% colspan="1" %)(% colspan="1" %)
119 119  (((
... ... @@ -141,7 +141,7 @@
141 141  Parents
142 142  )))|(% class="highlight-yellow" data-highlight-colour="yellow" %)(% class="highlight-yellow" data-highlight-colour="yellow" %)
143 143  (((
144 -POLYLINE
159 +ORTHOGONAL
145 145  )))
146 146  |(% colspan="1" %)(% colspan="1" %)
147 147  (((
... ... @@ -264,6 +264,22 @@
264 264  (((
265 265  
266 266  )))
282 +|(% colspan="1" %)(% colspan="1" %)
283 +(((
284 +(% class="confluence-link" %)Port Anchor Offset
285 +)))|(% colspan="1" %)(% colspan="1" %)
286 +(((
287 +de.cau.cs.kieler.klay.layered.portAnchor
288 +)))|(% colspan="1" %)(% colspan="1" %)
289 +(((
290 +Object
291 +)))|(% colspan="1" %)(% colspan="1" %)
292 +(((
293 +Ports
294 +)))|(% colspan="1" %)(% colspan="1" %)
295 +(((
296 +
297 +)))
267 267  |(((
268 268  Port Constraints
269 269  )))|(((
... ... @@ -323,6 +323,22 @@
323 323  (((
324 324  UNDEFINED
325 325  )))
357 +|(% colspan="1" %)(% colspan="1" %)
358 +(((
359 +Port Spacing
360 +)))|(% colspan="1" %)(% colspan="1" %)
361 +(((
362 +de.cau.cs.kieler.portSpacing
363 +)))|(% colspan="1" %)(% colspan="1" %)
364 +(((
365 +Float
366 +)))|(% colspan="1" %)(% colspan="1" %)
367 +(((
368 +Nodes
369 +)))|(% class="highlight-yellow" colspan="1" data-highlight-colour="yellow" %)(% class="highlight-yellow" colspan="1" data-highlight-colour="yellow" %)
370 +(((
371 +10
372 +)))
326 326  |(((
327 327  Priority
328 328  )))|(((
... ... @@ -432,6 +432,44 @@
432 432  (((
433 433  Dependency
434 434  )))
482 +|(% colspan="1" %)(% colspan="1" %)
483 +(((
484 +[[Add Unnecessary Bendpoints>>doc:||anchor="addUnnecessaryBendpoints"]]
485 +)))|(% colspan="1" %)(% colspan="1" %)
486 +(((
487 +de.cau.cs.kieler.klay.layered.unnecessaryBendpoints
488 +)))|(% colspan="1" %)(% colspan="1" %)
489 +(((
490 +Boolean
491 +)))|(% colspan="1" %)(% colspan="1" %)
492 +(((
493 +Parents
494 +)))|(% colspan="1" %)(% colspan="1" %)
495 +(((
496 +false
497 +)))|(% colspan="1" %)(% colspan="1" %)
498 +(((
499 +
500 +)))
501 +|(% colspan="1" %)(% colspan="1" %)
502 +(((
503 +[[Content Alignment>>doc:||anchor="contentAlignment"]]
504 +)))|(% colspan="1" %)(% colspan="1" %)
505 +(((
506 +de.cau.cs.kieler.klay.layered.contentAlignment
507 +)))|(% colspan="1" %)(% colspan="1" %)
508 +(((
509 +EnumSet
510 +)))|(% colspan="1" %)(% colspan="1" %)
511 +(((
512 +Parents
513 +)))|(% colspan="1" %)(% colspan="1" %)
514 +(((
515 +V_TOP, H_LEFT
516 +)))|(% colspan="1" %)(% colspan="1" %)
517 +(((
518 +
519 +)))
435 435  |(((
436 436  [[Crossing Minimization>>doc:||anchor="crossingMinimization"]]
437 437  )))|(((
... ... @@ -488,7 +488,7 @@
488 488  Parents
489 489  )))|(% colspan="1" %)(% colspan="1" %)
490 490  (((
491 -SMART
576 +ALWAYS_DOWN
492 492  )))|(% colspan="1" %)(% colspan="1" %)
493 493  (((
494 494  
... ... @@ -571,22 +571,22 @@
571 571  )))
572 572  |(% colspan="1" %)(% colspan="1" %)
573 573  (((
574 -[[Maximal Iterations>>doc:||anchor="maximalIterations"]]
659 +[[Linear Segments Deflection Dampening>>doc:||anchor="deflectionDampening"]]
575 575  )))|(% colspan="1" %)(% colspan="1" %)
576 576  (((
577 -de.cau.cs.kieler.klay.layered.nodeLayering
662 +de.cau.cs.kieler.klay.layered.linearSegmentsDeflectionDampening
578 578  )))|(% colspan="1" %)(% colspan="1" %)
579 579  (((
580 -Int
665 +Float
581 581  )))|(% colspan="1" %)(% colspan="1" %)
582 582  (((
583 583  Parents
584 584  )))|(% colspan="1" %)(% colspan="1" %)
585 585  (((
586 -10.000.000
671 +0.3
587 587  )))|(% colspan="1" %)(% colspan="1" %)
588 588  (((
589 -nodeLayering=NETWORK_SIMPLEX
674 +nodePlace=LINEAR_SEGMENTS
590 590  )))
591 591  |(% colspan="1" %)(% colspan="1" %)
592 592  (((
... ... @@ -593,7 +593,7 @@
593 593  [[Merge Edges>>doc:||anchor="mergeEdges"]]
594 594  )))|(% colspan="1" %)(% colspan="1" %)
595 595  (((
596 -de.cau.cs.kieler.klay.layered.mergePorts
681 +de.cau.cs.kieler.klay.layered.mergeEdges
597 597  )))|(% colspan="1" %)(% colspan="1" %)
598 598  (((
599 599  Boolean
... ... @@ -659,25 +659,6 @@
659 659  (((
660 660  
661 661  )))
662 -|(% colspan="1" %)(% colspan="1" %)
663 -(((
664 -[[Port Anchor Offset>>doc:||anchor="portAnchor"]]
665 -)))|(% colspan="1" %)(% colspan="1" %)
666 -(((
667 -de.cau.cs.kieler.klay.layered.portAnchor
668 -)))|(% colspan="1" %)(% colspan="1" %)
669 -(((
670 -Object
671 -)))|(% colspan="1" %)(% colspan="1" %)
672 -(((
673 -Ports
674 -)))|(% colspan="1" %)(% colspan="1" %)
675 -(((
676 -
677 -)))|(% colspan="1" %)(% colspan="1" %)
678 -(((
679 -
680 -)))
681 681  |(((
682 682  [[Thoroughness>>doc:||anchor="thoroughness"]]
683 683  )))|(((
... ... @@ -687,7 +687,7 @@
687 687  )))|(((
688 688  Parents
689 689  )))|(((
690 -7
756 +10
691 691  )))|(% colspan="1" %)(% colspan="1" %)
692 692  (((
693 693  
... ... @@ -695,71 +695,67 @@
695 695  
696 696  = Detailed Documentation =
697 697  
698 -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.
764 +This section explains every layout option in more detail. See [[the KIML documentation>>doc:Kieler.Discontinued Projects.Infrastructure for Meta Layout (KIML).KIML Layout Options.WebHome]] for more information on KIML layout options. Those options are only mentioned here if KLay Layered adds some custom behavior.
699 699  
700 -== Crossing Minimization ==
766 +== ==
701 701  
768 +{{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.
702 702  
770 +== ==
703 703  
704 -{{id name="crossingMinimization"/}}
772 +{{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.
705 705  
706 -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:
774 +{{note}}
775 +This option is not tested for external ports with port constraints {{code language="none"}}FIXED_RATIO{{/code}} or {{code language="none"}}FIXED_POS{{/code}}.
776 +{{/note}}
707 707  
708 -* LAYER_SWEEP
778 +== ==
779 +
780 +{{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:
781 +
782 +* {{code language="none"}}LAYER_SWEEP{{/code}}
709 709  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.
710 -* INTERACTIVE
784 +* {{code language="none"}}INTERACTIVE{{/code}}
711 711  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.
712 712  
713 -== Cycle Breaking ==
787 +== ==
714 714  
789 +{{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:
715 715  
716 -
717 -{{id name="cycleBreaking"/}}
718 -
719 -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:
720 -
721 -* GREEDY
791 +* {{code language="none"}}GREEDY{{/code}}
722 722  This algorithm reverses edges greedily. The algorithm tries to avoid edges that have the //Priority// property set.
723 -* INTERACTIVE
793 +* {{code language="none"}}INTERACTIVE{{/code}}
724 724  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.
725 725  
726 -== Edge Spacing Factor ==
796 +== ==
727 727  
798 +{{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}}.
728 728  
800 +== ==
729 729  
730 -{{id name="edgeSpacingFactor"/}}
802 +{{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.
731 731  
732 -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.
733 -
734 734  [[image:attach:edgeSpacingFactor.png]]
735 735  
736 -== Edge Label Side Selection ==
806 +== ==
737 737  
808 +{{id name="edgeLabelSideSelection"/}}Edge Label Side SelectionDetermines how KLay Layered places edge labels. The following strategies are available:
738 738  
739 -
740 -{{id name="edgeLabelSideSelection"/}}
741 -
742 -Determines how KLay Layered places edge labels. The following strategies are available:
743 -
744 -* ALWAYS_UP
810 +* {{code language="none"}}ALWAYS_UP{{/code}}
745 745  Always places edge labels above the edge.
746 -* ALWAYS_DOWN
812 +* {{code language="none"}}ALWAYS_DOWN{{/code}}
747 747  Always places edge labels below the edge.
748 -* DIRECTION_UP
814 +* {{code language="none"}}DIRECTION_UP{{/code}}
749 749  Places edge labels above edges pointing right, and below edges pointing left.
750 -* DIRECTION_DOWN
816 +* {{code language="none"}}DIRECTION_DOWN{{/code}}
751 751  Places edge labels below edges pointing right, and above edges pointing left.
752 -* SMART
818 +* {{code language="none"}}SMART{{/code}}
753 753  Uses a heuristic that determines the best edge label placement, also taking the placement of port labels into account.
754 754  
755 -== Feedback Edges ==
821 +== ==
756 756  
823 +{{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.
757 757  
758 -
759 -{{id name="feedbackEdges"/}}
760 -
761 -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.
762 -
763 763  With feedback edges:
764 764  
765 765  [[image:attach:feedback_on.png]]
... ... @@ -768,37 +768,25 @@
768 768  
769 769  [[image:attach:feedback_off.png]]
770 770  
771 -== Fixed Alignment ==
833 +== ==
772 772  
835 +{{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.
773 773  
774 -
775 -{{id name="fixedAlignment"/}}
776 -
777 -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.
778 -
779 779  This option should usually be left alone.
780 780  
781 -== Interactive Reference Point ==
839 +== ==
782 782  
841 +{{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:
783 783  
784 -
785 -{{id name="interactiveReferencePoint"/}}
786 -
787 -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:
788 -
789 -* TOP_LEFT
843 +* {{code language="none"}}TOP_LEFT{{/code}}
790 790  The top left corner of a node is taken as the reference point.
791 -* CENTER
845 +* {{code language="none"}}CENTER{{/code}}
792 792  The center of a node is taken as the reference point.
793 793  
794 -== Layer Constraint ==
848 +== ==
795 795  
850 +{{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.
796 796  
797 -
798 -{{id name="layerConstraint"/}}
799 -
800 -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.
801 -
802 802  [[image:attach:layer_constraints.png]]
803 803  
804 804  {{note}}
... ... @@ -805,82 +805,56 @@
805 805  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.
806 806  {{/note}}
807 807  
808 -== Maximal Iterations ==
858 +== ==
809 809  
860 +{{id name="deflectionDampening"/}}Linear Segments Deflection Dampening
810 810  
862 +{{note}}
863 +This is a very advanced layout option that you normally shouldn't worry about.
864 +{{/note}}
811 811  
812 -{{id name="maximalIterations"/}}
866 +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.
813 813  
814 -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.
868 +== ==
815 815  
816 -== Merge Edges ==
870 +{{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.
817 817  
872 +== ==
818 818  
874 +{{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.
819 819  
820 -{{id name="mergeEdges"/}}
821 -
822 -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.
823 -
824 824  [[image:attach:merging.png]]
825 825  
826 -== Merge Hierarchy-Crossing Edges ==
878 +== ==
827 827  
880 +{{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.
828 828  
829 -
830 -{{id name="mergeHierarchyEdges"/}}
831 -
832 -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.
833 -
834 834  [[image:attach:merge_hierarchy_edges.png]]
835 835  
836 -== Node Layering ==
884 +== ==
837 837  
886 +{{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:
838 838  
839 -
840 -{{id name="nodeLayering"/}}
841 -
842 -Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
843 -
844 -* NETWORK_SIMPLEX
888 +* {{code language="none"}}NETWORK_SIMPLEX{{/code}}
845 845  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.
846 -* LONGEST_PATH
890 +* {{code language="none"}}LONGEST_PATH{{/code}}
847 847  A very simple algorithm that distributes nodes along their longest path to a sink node.
848 -* INTERACTIVE
892 +* {{code language="none"}}INTERACTIVE{{/code}}
849 849  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.
850 850  
851 -== Node Placement ==
895 +== ==
852 852  
897 +{{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:
853 853  
854 -
855 -{{id name="nodePlacement"/}}
856 -
857 -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:
858 -
859 -* BRANDES_KOEPF
899 +* {{code language="none"}}BRANDES_KOEPF{{/code}}
860 860  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.
861 -* LINEAR_SEGMENTS
901 +* {{code language="none"}}LINEAR_SEGMENTS{{/code}}
862 862  Computes a balanced placement.
863 -* BUCHHEIM_JUENGER_LEIPERT
864 -Also computes a balanced placement, but a little faster.
865 -* SIMPLE
903 +* {{code language="none"}}INTERACTIVE{{/code}}
904 +Tries to keep the preset y coordinates of nodes from the original layout. For dummy nodes, a guess is made to infer their coordinates. Requires the other interactive phase implementations to have run as well.
905 +* {{code language="none"}}SIMPLE{{/code}}
866 866  Minimizes the area at the expense of... well, pretty much everything else.
867 867  
868 -== Port Anchor Offset ==
908 +== ==
869 869  
870 -
871 -
872 -{{id name="portAnchor"/}}
873 -
874 -Since ports have a size, we need a concrete point inside the port that edges should start or end in. In KLay Layered, this is referred to as the //port anchor//. By default, the center of each port is used as its port anchor, but this behavior can be overridden by setting an explicit port anchor.
875 -
876 -In the following example, the port anchor of the left port was moved upwards, while the port anchor of the second port was moved downwards:
877 -
878 -[[image:attach:port_anchors.png]]
879 -
880 -== Thoroughness ==
881 -
882 -
883 -
884 -{{id name="thoroughness"/}}
885 -
886 -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.
910 +{{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.
edgeSpacingFactor.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +10.2 KB
Content
feedback_off.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +7.1 KB
Content
feedback_on.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +11.4 KB
Content
layer_constraints.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +17.5 KB
Content
merge_hierarchy_edges.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +102.1 KB
Content
merging.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +16.0 KB
Content
port_anchors.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +5.4 KB
Content
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9470239
1 +7111098
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470239/KLay Layered Layout Options
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/7111098/KLay Layered Layout Options

Navigation

Quick Links

KIELER on GitHub
RTSYS Homepage