Last modified by Richard Kreissig on 2023/09/14 10:20
<
From version < 17.1 >
edited by cds
on 2014/03/14 15:21
To version < 46.2 >
edited by Alexander Schulz-Rosengarten
on 2023/07/11 10:25
>
Change comment: Update document after refactoring.

Summary

Details

Page properties
Parent
... ... @@ -1,0 +1,1 @@
1 +Kieler.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.WebHome
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.cds
1 +XWiki.als
Content
... ... @@ -1,7 +5,3 @@
1 -{{warning}}
2 -This is preliminary and incomplete documentation. You've been warned.
3 -{{/warning}}
4 -
5 5  KLay Layered supports a whole bunch of layout options. Every single one of them is documented here.
6 6  
7 7  **Contents**
... ... @@ -12,11 +12,11 @@
12 12  
13 13  = Overview =
14 14  
15 -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.
16 16  
17 17  == Supported KIML Layout Options ==
18 18  
19 -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]].
20 20  
21 21  |=(((
22 22  Option
... ... @@ -29,6 +29,22 @@
29 29  )))|=(((
30 30  Default
31 31  )))
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 +)))
32 32  |(((
33 33  Alignment
34 34  )))|(((
... ... @@ -108,7 +108,7 @@
108 108  
109 109  )))
110 110  |(((
111 -Direction
123 +[[Direction>>doc:||anchor="direction"]]
112 112  )))|(((
113 113  de.cau.cs.kieler.direction
114 114  )))|(((
... ... @@ -115,9 +115,8 @@
115 115  Enum
116 116  )))|(((
117 117  Parents
118 -)))|(% class="highlight-yellow" data-highlight-colour="yellow" %)(% class="highlight-yellow" data-highlight-colour="yellow" %)
119 -(((
120 -RIGHT
130 +)))|(((
131 +UNDEFINED
121 121  )))
122 122  |(% colspan="1" %)(% colspan="1" %)
123 123  (((
... ... @@ -145,7 +145,7 @@
145 145  Parents
146 146  )))|(% class="highlight-yellow" data-highlight-colour="yellow" %)(% class="highlight-yellow" data-highlight-colour="yellow" %)
147 147  (((
148 -POLYLINE
159 +ORTHOGONAL
149 149  )))
150 150  |(% colspan="1" %)(% colspan="1" %)
151 151  (((
... ... @@ -268,6 +268,22 @@
268 268  (((
269 269  
270 270  )))
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 +)))
271 271  |(((
272 272  Port Constraints
273 273  )))|(((
... ... @@ -327,6 +327,22 @@
327 327  (((
328 328  UNDEFINED
329 329  )))
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 +)))
330 330  |(((
331 331  Priority
332 332  )))|(((
... ... @@ -436,6 +436,44 @@
436 436  (((
437 437  Dependency
438 438  )))
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 +)))
439 439  |(((
440 440  [[Crossing Minimization>>doc:||anchor="crossingMinimization"]]
441 441  )))|(((
... ... @@ -480,6 +480,25 @@
480 480  )))
481 481  |(% colspan="1" %)(% colspan="1" %)
482 482  (((
564 +[[Edge Label Side Selection>>doc:||anchor="edgeLabelSideSelection"]]
565 +)))|(% colspan="1" %)(% colspan="1" %)
566 +(((
567 +de.cau.cs.kieler.klay.layered.edgeLabelSideSelection
568 +)))|(% colspan="1" %)(% colspan="1" %)
569 +(((
570 +Enum
571 +)))|(% colspan="1" %)(% colspan="1" %)
572 +(((
573 +Parents
574 +)))|(% colspan="1" %)(% colspan="1" %)
575 +(((
576 +ALWAYS_DOWN
577 +)))|(% colspan="1" %)(% colspan="1" %)
578 +(((
579 +
580 +)))
581 +|(% colspan="1" %)(% colspan="1" %)
582 +(((
483 483  [[Feedback Edges>>doc:||anchor="feedbackEdges"]]
484 484  )))|(% colspan="1" %)(% colspan="1" %)
485 485  (((
... ... @@ -556,22 +556,22 @@
556 556  )))
557 557  |(% colspan="1" %)(% colspan="1" %)
558 558  (((
559 -[[Maximal Iterations>>doc:||anchor="maximalIterations"]]
659 +[[Linear Segments Deflection Dampening>>doc:||anchor="deflectionDampening"]]
560 560  )))|(% colspan="1" %)(% colspan="1" %)
561 561  (((
562 -de.cau.cs.kieler.klay.layered.nodeLayering
662 +de.cau.cs.kieler.klay.layered.linearSegmentsDeflectionDampening
563 563  )))|(% colspan="1" %)(% colspan="1" %)
564 564  (((
565 -Int
665 +Float
566 566  )))|(% colspan="1" %)(% colspan="1" %)
567 567  (((
568 568  Parents
569 569  )))|(% colspan="1" %)(% colspan="1" %)
570 570  (((
571 -10.000.000
671 +0.3
572 572  )))|(% colspan="1" %)(% colspan="1" %)
573 573  (((
574 -nodeLayering=NETWORK_SIMPLEX
674 +nodePlace=LINEAR_SEGMENTS
575 575  )))
576 576  |(% colspan="1" %)(% colspan="1" %)
577 577  (((
... ... @@ -578,7 +578,7 @@
578 578  [[Merge Edges>>doc:||anchor="mergeEdges"]]
579 579  )))|(% colspan="1" %)(% colspan="1" %)
580 580  (((
581 -de.cau.cs.kieler.klay.layered.mergePorts
681 +de.cau.cs.kieler.klay.layered.mergeEdges
582 582  )))|(% colspan="1" %)(% colspan="1" %)
583 583  (((
584 584  Boolean
... ... @@ -609,7 +609,7 @@
609 609  true
610 610  )))|(% colspan="1" %)(% colspan="1" %)
611 611  (((
612 -
712 +layoutHierarchy=true
613 613  )))
614 614  |(((
615 615  [[Node Layering>>doc:||anchor="nodeLayering"]]
... ... @@ -644,25 +644,6 @@
644 644  (((
645 645  
646 646  )))
647 -|(% colspan="1" %)(% colspan="1" %)
648 -(((
649 -[[Port Anchor Offset>>doc:||anchor="portAnchor"]]
650 -)))|(% colspan="1" %)(% colspan="1" %)
651 -(((
652 -de.cau.cs.kieler.klay.layered.portAnchor
653 -)))|(% colspan="1" %)(% colspan="1" %)
654 -(((
655 -Object
656 -)))|(% colspan="1" %)(% colspan="1" %)
657 -(((
658 -Ports
659 -)))|(% colspan="1" %)(% colspan="1" %)
660 -(((
661 -
662 -)))|(% colspan="1" %)(% colspan="1" %)
663 -(((
664 -
665 -)))
666 666  |(((
667 667  [[Thoroughness>>doc:||anchor="thoroughness"]]
668 668  )))|(((
... ... @@ -672,172 +672,158 @@
672 672  )))|(((
673 673  Parents
674 674  )))|(((
675 -7
756 +10
676 676  )))|(% colspan="1" %)(% colspan="1" %)
677 677  (((
678 678  
679 679  )))
680 680  
681 -= The Most Important Options =
762 += Detailed Documentation =
682 682  
683 -**TODO:** Write a bit of documentation about the most important layout options and how to use them, possibly with a simple example or something.
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.
684 684  
685 -= Detailed Documentation =
766 +== ==
686 686  
687 -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.
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.
688 688  
689 -== Crossing Minimization ==
770 +== ==
690 690  
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.
691 691  
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}}
692 692  
693 -{{id name="crossingMinimization"/}}
778 +== ==
694 694  
695 -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:
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:
696 696  
697 -* LAYER_SWEEP
782 +* {{code language="none"}}LAYER_SWEEP{{/code}}
698 698  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.
699 -* INTERACTIVE
784 +* {{code language="none"}}INTERACTIVE{{/code}}
700 700  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.
701 701  
702 -== Cycle Breaking ==
787 +== ==
703 703  
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:
704 704  
705 -
706 -{{id name="cycleBreaking"/}}
707 -
708 -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:
709 -
710 -* GREEDY
791 +* {{code language="none"}}GREEDY{{/code}}
711 711  This algorithm reverses edges greedily. The algorithm tries to avoid edges that have the //Priority// property set.
712 -* INTERACTIVE
793 +* {{code language="none"}}INTERACTIVE{{/code}}
713 713  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.
714 714  
715 -== Edge Spacing Factor ==
796 +== ==
716 716  
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}}.
717 717  
800 +== ==
718 718  
719 -{{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.
720 720  
721 -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.
722 -
723 723  [[image:attach:edgeSpacingFactor.png]]
724 724  
725 -== Feedback Edges ==
806 +== ==
726 726  
808 +{{id name="edgeLabelSideSelection"/}}Edge Label Side SelectionDetermines how KLay Layered places edge labels. The following strategies are available:
727 727  
810 +* {{code language="none"}}ALWAYS_UP{{/code}}
811 +Always places edge labels above the edge.
812 +* {{code language="none"}}ALWAYS_DOWN{{/code}}
813 +Always places edge labels below the edge.
814 +* {{code language="none"}}DIRECTION_UP{{/code}}
815 +Places edge labels above edges pointing right, and below edges pointing left.
816 +* {{code language="none"}}DIRECTION_DOWN{{/code}}
817 +Places edge labels below edges pointing right, and above edges pointing left.
818 +* {{code language="none"}}SMART{{/code}}
819 +Uses a heuristic that determines the best edge label placement, also taking the placement of port labels into account.
728 728  
729 -{{id name="feedbackEdges"/}}
821 +== ==
730 730  
731 -{{warning}}
732 -Document!
733 -{{/warning}}
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.
734 734  
735 -== Fixed Alignment ==
825 +With feedback edges:
736 736  
827 +[[image:attach:feedback_on.png]]
737 737  
829 +Without feedback edges:
738 738  
739 -{{id name="fixedAlignment"/}}
831 +[[image:attach:feedback_off.png]]
740 740  
741 -{{warning}}
742 -Document!
743 -{{/warning}}
833 +== ==
744 744  
745 -
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.
746 746  
747 -== Interactive Reference Point ==
837 +This option should usually be left alone.
748 748  
839 +== ==
749 749  
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:
750 750  
751 -{{id name="interactiveReferencePoint"/}}
752 -
753 -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:
754 -
755 -* TOP_LEFT
843 +* {{code language="none"}}TOP_LEFT{{/code}}
756 756  The top left corner of a node is taken as the reference point.
757 -* CENTER
845 +* {{code language="none"}}CENTER{{/code}}
758 758  The center of a node is taken as the reference point.
759 759  
760 -== Layer Constraint ==
848 +== ==
761 761  
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.
762 762  
852 +[[image:attach:layer_constraints.png]]
763 763  
764 -{{id name="layerConstraint"/}}
854 +{{note}}
855 +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.
856 +{{/note}}
765 765  
766 -{{warning}}
767 -Document!
768 -{{/warning}}
858 +== ==
769 769  
770 -
860 +{{id name="deflectionDampening"/}}Linear Segments Deflection Dampening
771 771  
772 -== Maximal Iterations ==
862 +{{note}}
863 +This is a very advanced layout option that you normally shouldn't worry about.
864 +{{/note}}
773 773  
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.
774 774  
868 +== ==
775 775  
776 -{{id name="maximalIterations"/}}
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.
777 777  
778 -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.
872 +== ==
779 779  
780 -== Merge Edges ==
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.
781 781  
782 -
783 -
784 -{{id name="mergeEdges"/}}
785 -
786 -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.
787 -
788 788  [[image:attach:merging.png]]
789 789  
790 -== Merge Hierarchy-Crossing Edges ==
878 +== ==
791 791  
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.
792 792  
882 +[[image:attach:merge_hierarchy_edges.png]]
793 793  
794 -{{id name="mergeHierarchyEdges"/}}
884 +== ==
795 795  
796 -{{warning}}
797 -Document!
798 -{{/warning}}
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:
799 799  
800 -== Node Layering ==
801 -
802 -
803 -
804 -{{id name="nodeLayering"/}}
805 -
806 -Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
807 -
808 -* NETWORK_SIMPLEX
888 +* {{code language="none"}}NETWORK_SIMPLEX{{/code}}
809 809  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.
810 -* LONGEST_PATH
890 +* {{code language="none"}}LONGEST_PATH{{/code}}
811 811  A very simple algorithm that distributes nodes along their longest path to a sink node.
812 -* INTERACTIVE
892 +* {{code language="none"}}INTERACTIVE{{/code}}
813 813  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.
814 814  
815 -== Node Placement ==
895 +== ==
816 816  
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:
817 817  
899 +* {{code language="none"}}BRANDES_KOEPF{{/code}}
900 +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.
901 +* {{code language="none"}}LINEAR_SEGMENTS{{/code}}
902 +Computes a balanced placement.
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}}
906 +Minimizes the area at the expense of... well, pretty much everything else.
818 818  
819 -{{id name="nodePlacement"/}}
908 +== ==
820 820  
821 -{{warning}}
822 -Document!
823 -{{/warning}}
824 -
825 -== Port Anchor Offset ==
826 -
827 -
828 -
829 -{{id name="portAnchor"/}}
830 -
831 -{{warning}}
832 -Document!
833 -{{/warning}}
834 -
835 -
836 -
837 -== Thoroughness ==
838 -
839 -
840 -
841 -{{id name="thoroughness"/}}
842 -
843 -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 -9470076
1 +7111098
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470076/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