Last modified by Richard Kreissig on 2023/09/14 10:20
<
From version < 30.1 >
edited by cds
on 2014/08/22 15:33
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
... ... @@ -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
... ... @@ -120,7 +120,7 @@
120 120  
121 121  )))
122 122  |(((
123 -Direction
123 +[[Direction>>doc:||anchor="direction"]]
124 124  )))|(((
125 125  de.cau.cs.kieler.direction
126 126  )))|(((
... ... @@ -127,9 +127,8 @@
127 127  Enum
128 128  )))|(((
129 129  Parents
130 -)))|(% class="highlight-yellow" data-highlight-colour="yellow" %)(% class="highlight-yellow" data-highlight-colour="yellow" %)
131 -(((
132 -RIGHT
130 +)))|(((
131 +UNDEFINED
133 133  )))
134 134  |(% colspan="1" %)(% colspan="1" %)
135 135  (((
... ... @@ -157,7 +157,7 @@
157 157  Parents
158 158  )))|(% class="highlight-yellow" data-highlight-colour="yellow" %)(% class="highlight-yellow" data-highlight-colour="yellow" %)
159 159  (((
160 -POLYLINE
159 +ORTHOGONAL
161 161  )))
162 162  |(% colspan="1" %)(% colspan="1" %)
163 163  (((
... ... @@ -280,6 +280,22 @@
280 280  (((
281 281  
282 282  )))
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 +)))
283 283  |(((
284 284  Port Constraints
285 285  )))|(((
... ... @@ -464,6 +464,44 @@
464 464  (((
465 465  Dependency
466 466  )))
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 +)))
467 467  |(((
468 468  [[Crossing Minimization>>doc:||anchor="crossingMinimization"]]
469 469  )))|(((
... ... @@ -520,7 +520,7 @@
520 520  Parents
521 521  )))|(% colspan="1" %)(% colspan="1" %)
522 522  (((
523 -SMART
576 +ALWAYS_DOWN
524 524  )))|(% colspan="1" %)(% colspan="1" %)
525 525  (((
526 526  
... ... @@ -622,29 +622,10 @@
622 622  )))
623 623  |(% colspan="1" %)(% colspan="1" %)
624 624  (((
625 -[[Maximal Iterations>>doc:||anchor="maximalIterations"]]
626 -)))|(% colspan="1" %)(% colspan="1" %)
627 -(((
628 -de.cau.cs.kieler.klay.layered.nodeLayering
629 -)))|(% colspan="1" %)(% colspan="1" %)
630 -(((
631 -Int
632 -)))|(% colspan="1" %)(% colspan="1" %)
633 -(((
634 -Parents
635 -)))|(% colspan="1" %)(% colspan="1" %)
636 -(((
637 -10.000.000
638 -)))|(% colspan="1" %)(% colspan="1" %)
639 -(((
640 -nodeLayering=NETWORK_SIMPLEX
641 -)))
642 -|(% colspan="1" %)(% colspan="1" %)
643 -(((
644 644  [[Merge Edges>>doc:||anchor="mergeEdges"]]
645 645  )))|(% colspan="1" %)(% colspan="1" %)
646 646  (((
647 -de.cau.cs.kieler.klay.layered.mergePorts
681 +de.cau.cs.kieler.klay.layered.mergeEdges
648 648  )))|(% colspan="1" %)(% colspan="1" %)
649 649  (((
650 650  Boolean
... ... @@ -710,25 +710,6 @@
710 710  (((
711 711  
712 712  )))
713 -|(% colspan="1" %)(% colspan="1" %)
714 -(((
715 -[[Port Anchor Offset>>doc:||anchor="portAnchor"]]
716 -)))|(% colspan="1" %)(% colspan="1" %)
717 -(((
718 -de.cau.cs.kieler.klay.layered.portAnchor
719 -)))|(% colspan="1" %)(% colspan="1" %)
720 -(((
721 -Object
722 -)))|(% colspan="1" %)(% colspan="1" %)
723 -(((
724 -Ports
725 -)))|(% colspan="1" %)(% colspan="1" %)
726 -(((
727 -
728 -)))|(% colspan="1" %)(% colspan="1" %)
729 -(((
730 -
731 -)))
732 732  |(((
733 733  [[Thoroughness>>doc:||anchor="thoroughness"]]
734 734  )))|(((
... ... @@ -738,7 +738,7 @@
738 738  )))|(((
739 739  Parents
740 740  )))|(((
741 -7
756 +10
742 742  )))|(% colspan="1" %)(% colspan="1" %)
743 743  (((
744 744  
... ... @@ -746,71 +746,67 @@
746 746  
747 747  = Detailed Documentation =
748 748  
749 -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.
750 750  
751 -== Crossing Minimization ==
766 +== ==
752 752  
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.
753 753  
770 +== ==
754 754  
755 -{{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.
756 756  
757 -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}}
758 758  
759 -* 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}}
760 760  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.
761 -* INTERACTIVE
784 +* {{code language="none"}}INTERACTIVE{{/code}}
762 762  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.
763 763  
764 -== Cycle Breaking ==
787 +== ==
765 765  
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:
766 766  
767 -
768 -{{id name="cycleBreaking"/}}
769 -
770 -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:
771 -
772 -* GREEDY
791 +* {{code language="none"}}GREEDY{{/code}}
773 773  This algorithm reverses edges greedily. The algorithm tries to avoid edges that have the //Priority// property set.
774 -* INTERACTIVE
793 +* {{code language="none"}}INTERACTIVE{{/code}}
775 775  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.
776 776  
777 -== Edge Spacing Factor ==
796 +== ==
778 778  
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}}.
779 779  
800 +== ==
780 780  
781 -{{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.
782 782  
783 -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.
784 -
785 785  [[image:attach:edgeSpacingFactor.png]]
786 786  
787 -== Edge Label Side Selection ==
806 +== ==
788 788  
808 +{{id name="edgeLabelSideSelection"/}}Edge Label Side SelectionDetermines how KLay Layered places edge labels. The following strategies are available:
789 789  
790 -
791 -{{id name="edgeLabelSideSelection"/}}
792 -
793 -Determines how KLay Layered places edge labels. The following strategies are available:
794 -
795 -* ALWAYS_UP
810 +* {{code language="none"}}ALWAYS_UP{{/code}}
796 796  Always places edge labels above the edge.
797 -* ALWAYS_DOWN
812 +* {{code language="none"}}ALWAYS_DOWN{{/code}}
798 798  Always places edge labels below the edge.
799 -* DIRECTION_UP
814 +* {{code language="none"}}DIRECTION_UP{{/code}}
800 800  Places edge labels above edges pointing right, and below edges pointing left.
801 -* DIRECTION_DOWN
816 +* {{code language="none"}}DIRECTION_DOWN{{/code}}
802 802  Places edge labels below edges pointing right, and above edges pointing left.
803 -* SMART
818 +* {{code language="none"}}SMART{{/code}}
804 804  Uses a heuristic that determines the best edge label placement, also taking the placement of port labels into account.
805 805  
806 -== Feedback Edges ==
821 +== ==
807 807  
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.
808 808  
809 -
810 -{{id name="feedbackEdges"/}}
811 -
812 -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.
813 -
814 814  With feedback edges:
815 815  
816 816  [[image:attach:feedback_on.png]]
... ... @@ -819,37 +819,25 @@
819 819  
820 820  [[image:attach:feedback_off.png]]
821 821  
822 -== Fixed Alignment ==
833 +== ==
823 823  
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.
824 824  
825 -
826 -{{id name="fixedAlignment"/}}
827 -
828 -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.
829 -
830 830  This option should usually be left alone.
831 831  
832 -== Interactive Reference Point ==
839 +== ==
833 833  
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:
834 834  
835 -
836 -{{id name="interactiveReferencePoint"/}}
837 -
838 -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:
839 -
840 -* TOP_LEFT
843 +* {{code language="none"}}TOP_LEFT{{/code}}
841 841  The top left corner of a node is taken as the reference point.
842 -* CENTER
845 +* {{code language="none"}}CENTER{{/code}}
843 843  The center of a node is taken as the reference point.
844 844  
845 -== Layer Constraint ==
848 +== ==
846 846  
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.
847 847  
848 -
849 -{{id name="layerConstraint"/}}
850 -
851 -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.
852 -
853 853  [[image:attach:layer_constraints.png]]
854 854  
855 855  {{note}}
... ... @@ -856,12 +856,10 @@
856 856  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.
857 857  {{/note}}
858 858  
859 -== Linear Segments Deflection Dampening ==
858 +== ==
860 860  
860 +{{id name="deflectionDampening"/}}Linear Segments Deflection Dampening
861 861  
862 -
863 -{{id name="deflectionDampening"/}}
864 -
865 865  {{note}}
866 866  This is a very advanced layout option that you normally shouldn't worry about.
867 867  {{/note}}
... ... @@ -868,82 +868,46 @@
868 868  
869 869  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.
870 870  
871 -== Maximal Iterations ==
868 +== ==
872 872  
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.
873 873  
872 +== ==
874 874  
875 -{{id name="maximalIterations"/}}
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.
876 876  
877 -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.
878 -
879 -== Merge Edges ==
880 -
881 -
882 -
883 -{{id name="mergeEdges"/}}
884 -
885 -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.
886 -
887 887  [[image:attach:merging.png]]
888 888  
889 -== Merge Hierarchy-Crossing Edges ==
878 +== ==
890 890  
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.
891 891  
892 -
893 -{{id name="mergeHierarchyEdges"/}}
894 -
895 -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.
896 -
897 897  [[image:attach:merge_hierarchy_edges.png]]
898 898  
899 -== Node Layering ==
884 +== ==
900 900  
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:
901 901  
902 -
903 -{{id name="nodeLayering"/}}
904 -
905 -Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
906 -
907 -* NETWORK_SIMPLEX
888 +* {{code language="none"}}NETWORK_SIMPLEX{{/code}}
908 908  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.
909 -* LONGEST_PATH
890 +* {{code language="none"}}LONGEST_PATH{{/code}}
910 910  A very simple algorithm that distributes nodes along their longest path to a sink node.
911 -* INTERACTIVE
892 +* {{code language="none"}}INTERACTIVE{{/code}}
912 912  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.
913 913  
914 -== Node Placement ==
895 +== ==
915 915  
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:
916 916  
917 -
918 -{{id name="nodePlacement"/}}
919 -
920 -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:
921 -
922 -* BRANDES_KOEPF
899 +* {{code language="none"}}BRANDES_KOEPF{{/code}}
923 923  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.
924 -* LINEAR_SEGMENTS
901 +* {{code language="none"}}LINEAR_SEGMENTS{{/code}}
925 925  Computes a balanced placement.
926 -* BUCHHEIM_JUENGER_LEIPERT
927 -Also computes a balanced placement, but a little faster.
928 -* 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}}
929 929  Minimizes the area at the expense of... well, pretty much everything else.
930 930  
931 -== Port Anchor Offset ==
908 +== ==
932 932  
933 -
934 -
935 -{{id name="portAnchor"/}}
936 -
937 -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.
938 -
939 -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:
940 -
941 -[[image:attach:port_anchors.png]]
942 -
943 -== Thoroughness ==
944 -
945 -
946 -
947 -{{id name="thoroughness"/}}
948 -
949 -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 -9471893
1 +7111098
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9471893/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