Last modified by Richard Kreissig on 2023/09/14 10:20
<
From version < 33.1 >
edited by cds
on 2015/01/25 12:53
To version < 48.1 >
edited by Alexander Schulz-Rosengarten
on 2023/07/11 10:33
>
Change comment: Renamed from xwiki:Kieler.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.KLay Layered Layout Options.WebHome

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
... ... @@ -156,7 +156,7 @@
156 156  Parents
157 157  )))|(% class="highlight-yellow" data-highlight-colour="yellow" %)(% class="highlight-yellow" data-highlight-colour="yellow" %)
158 158  (((
159 -POLYLINE
159 +ORTHOGONAL
160 160  )))
161 161  |(% colspan="1" %)(% colspan="1" %)
162 162  (((
... ... @@ -279,6 +279,22 @@
279 279  (((
280 280  
281 281  )))
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 +)))
282 282  |(((
283 283  Port Constraints
284 284  )))|(((
... ... @@ -482,6 +482,25 @@
482 482  (((
483 483  
484 484  )))
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 +)))
485 485  |(((
486 486  [[Crossing Minimization>>doc:||anchor="crossingMinimization"]]
487 487  )))|(((
... ... @@ -538,7 +538,7 @@
538 538  Parents
539 539  )))|(% colspan="1" %)(% colspan="1" %)
540 540  (((
541 -SMART
576 +ALWAYS_DOWN
542 542  )))|(% colspan="1" %)(% colspan="1" %)
543 543  (((
544 544  
... ... @@ -640,25 +640,6 @@
640 640  )))
641 641  |(% colspan="1" %)(% colspan="1" %)
642 642  (((
643 -[[Maximal Iterations>>doc:||anchor="maximalIterations"]]
644 -)))|(% colspan="1" %)(% colspan="1" %)
645 -(((
646 -de.cau.cs.kieler.klay.layered.nodeLayering
647 -)))|(% colspan="1" %)(% colspan="1" %)
648 -(((
649 -Int
650 -)))|(% colspan="1" %)(% colspan="1" %)
651 -(((
652 -Parents
653 -)))|(% colspan="1" %)(% colspan="1" %)
654 -(((
655 -10.000.000
656 -)))|(% colspan="1" %)(% colspan="1" %)
657 -(((
658 -nodeLayering=NETWORK_SIMPLEX
659 -)))
660 -|(% colspan="1" %)(% colspan="1" %)
661 -(((
662 662  [[Merge Edges>>doc:||anchor="mergeEdges"]]
663 663  )))|(% colspan="1" %)(% colspan="1" %)
664 664  (((
... ... @@ -728,25 +728,6 @@
728 728  (((
729 729  
730 730  )))
731 -|(% colspan="1" %)(% colspan="1" %)
732 -(((
733 -[[Port Anchor Offset>>doc:||anchor="portAnchor"]]
734 -)))|(% colspan="1" %)(% colspan="1" %)
735 -(((
736 -de.cau.cs.kieler.klay.layered.portAnchor
737 -)))|(% colspan="1" %)(% colspan="1" %)
738 -(((
739 -Object
740 -)))|(% colspan="1" %)(% colspan="1" %)
741 -(((
742 -Ports
743 -)))|(% colspan="1" %)(% colspan="1" %)
744 -(((
745 -
746 -)))|(% colspan="1" %)(% colspan="1" %)
747 -(((
748 -
749 -)))
750 750  |(((
751 751  [[Thoroughness>>doc:||anchor="thoroughness"]]
752 752  )))|(((
... ... @@ -756,7 +756,7 @@
756 756  )))|(((
757 757  Parents
758 758  )))|(((
759 -7
756 +10
760 760  )))|(% colspan="1" %)(% colspan="1" %)
761 761  (((
762 762  
... ... @@ -764,87 +764,67 @@
764 764  
765 765  = Detailed Documentation =
766 766  
767 -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.
768 768  
769 -== Add Unnecessary Bendpoints ==
766 +== ==
770 770  
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.
771 771  
770 +== ==
772 772  
773 -{{id name="addUnnecessaryBendpoints"/}}
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.
774 774  
775 -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.
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}}
776 776  
777 -== Crossing Minimization ==
778 +== ==
778 778  
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:
779 779  
780 -
781 -{{id name="crossingMinimization"/}}
782 -
783 -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:
784 -
785 -* LAYER_SWEEP
782 +* {{code language="none"}}LAYER_SWEEP{{/code}}
786 786  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.
787 -* INTERACTIVE
784 +* {{code language="none"}}INTERACTIVE{{/code}}
788 788  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.
789 789  
790 -== Cycle Breaking ==
787 +== ==
791 791  
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:
792 792  
793 -
794 -{{id name="cycleBreaking"/}}
795 -
796 -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:
797 -
798 -* GREEDY
791 +* {{code language="none"}}GREEDY{{/code}}
799 799  This algorithm reverses edges greedily. The algorithm tries to avoid edges that have the //Priority// property set.
800 -* INTERACTIVE
793 +* {{code language="none"}}INTERACTIVE{{/code}}
801 801  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.
802 802  
803 -== Direction ==
796 +== ==
804 804  
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}}.
805 805  
800 +== ==
806 806  
807 -{{id name="direction"/}}
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.
808 808  
809 -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}}.
810 -
811 -== Edge Spacing Factor ==
812 -
813 -
814 -
815 -{{id name="edgeSpacingFactor"/}}
816 -
817 -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.
818 -
819 819  [[image:attach:edgeSpacingFactor.png]]
820 820  
821 -== Edge Label Side Selection ==
806 +== ==
822 822  
808 +{{id name="edgeLabelSideSelection"/}}Edge Label Side SelectionDetermines how KLay Layered places edge labels. The following strategies are available:
823 823  
824 -
825 -{{id name="edgeLabelSideSelection"/}}
826 -
827 -Determines how KLay Layered places edge labels. The following strategies are available:
828 -
829 -* ALWAYS_UP
810 +* {{code language="none"}}ALWAYS_UP{{/code}}
830 830  Always places edge labels above the edge.
831 -* ALWAYS_DOWN
812 +* {{code language="none"}}ALWAYS_DOWN{{/code}}
832 832  Always places edge labels below the edge.
833 -* DIRECTION_UP
814 +* {{code language="none"}}DIRECTION_UP{{/code}}
834 834  Places edge labels above edges pointing right, and below edges pointing left.
835 -* DIRECTION_DOWN
816 +* {{code language="none"}}DIRECTION_DOWN{{/code}}
836 836  Places edge labels below edges pointing right, and above edges pointing left.
837 -* SMART
818 +* {{code language="none"}}SMART{{/code}}
838 838  Uses a heuristic that determines the best edge label placement, also taking the placement of port labels into account.
839 839  
840 -== Feedback Edges ==
821 +== ==
841 841  
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.
842 842  
843 -
844 -{{id name="feedbackEdges"/}}
845 -
846 -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.
847 -
848 848  With feedback edges:
849 849  
850 850  [[image:attach:feedback_on.png]]
... ... @@ -853,37 +853,25 @@
853 853  
854 854  [[image:attach:feedback_off.png]]
855 855  
856 -== Fixed Alignment ==
833 +== ==
857 857  
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.
858 858  
859 -
860 -{{id name="fixedAlignment"/}}
861 -
862 -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.
863 -
864 864  This option should usually be left alone.
865 865  
866 -== Interactive Reference Point ==
839 +== ==
867 867  
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:
868 868  
869 -
870 -{{id name="interactiveReferencePoint"/}}
871 -
872 -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:
873 -
874 -* TOP_LEFT
843 +* {{code language="none"}}TOP_LEFT{{/code}}
875 875  The top left corner of a node is taken as the reference point.
876 -* CENTER
845 +* {{code language="none"}}CENTER{{/code}}
877 877  The center of a node is taken as the reference point.
878 878  
879 -== Layer Constraint ==
848 +== ==
880 880  
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.
881 881  
882 -
883 -{{id name="layerConstraint"/}}
884 -
885 -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.
886 -
887 887  [[image:attach:layer_constraints.png]]
888 888  
889 889  {{note}}
... ... @@ -890,12 +890,10 @@
890 890  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.
891 891  {{/note}}
892 892  
893 -== Linear Segments Deflection Dampening ==
858 +== ==
894 894  
860 +{{id name="deflectionDampening"/}}Linear Segments Deflection Dampening
895 895  
896 -
897 -{{id name="deflectionDampening"/}}
898 -
899 899  {{note}}
900 900  This is a very advanced layout option that you normally shouldn't worry about.
901 901  {{/note}}
... ... @@ -902,82 +902,46 @@
902 902  
903 903  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.
904 904  
905 -== Maximal Iterations ==
868 +== ==
906 906  
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.
907 907  
872 +== ==
908 908  
909 -{{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.
910 910  
911 -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.
912 -
913 -== Merge Edges ==
914 -
915 -
916 -
917 -{{id name="mergeEdges"/}}
918 -
919 -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.
920 -
921 921  [[image:attach:merging.png]]
922 922  
923 -== Merge Hierarchy-Crossing Edges ==
878 +== ==
924 924  
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.
925 925  
926 -
927 -{{id name="mergeHierarchyEdges"/}}
928 -
929 -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.
930 -
931 931  [[image:attach:merge_hierarchy_edges.png]]
932 932  
933 -== Node Layering ==
884 +== ==
934 934  
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:
935 935  
936 -
937 -{{id name="nodeLayering"/}}
938 -
939 -Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
940 -
941 -* NETWORK_SIMPLEX
888 +* {{code language="none"}}NETWORK_SIMPLEX{{/code}}
942 942  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.
943 -* LONGEST_PATH
890 +* {{code language="none"}}LONGEST_PATH{{/code}}
944 944  A very simple algorithm that distributes nodes along their longest path to a sink node.
945 -* INTERACTIVE
892 +* {{code language="none"}}INTERACTIVE{{/code}}
946 946  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.
947 947  
948 -== Node Placement ==
895 +== ==
949 949  
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:
950 950  
951 -
952 -{{id name="nodePlacement"/}}
953 -
954 -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:
955 -
956 -* BRANDES_KOEPF
899 +* {{code language="none"}}BRANDES_KOEPF{{/code}}
957 957  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.
958 -* LINEAR_SEGMENTS
901 +* {{code language="none"}}LINEAR_SEGMENTS{{/code}}
959 959  Computes a balanced placement.
960 -* BUCHHEIM_JUENGER_LEIPERT
961 -Also computes a balanced placement, but a little faster.
962 -* 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}}
963 963  Minimizes the area at the expense of... well, pretty much everything else.
964 964  
965 -== Port Anchor Offset ==
908 +== ==
966 966  
967 -
968 -
969 -{{id name="portAnchor"/}}
970 -
971 -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.
972 -
973 -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:
974 -
975 -[[image:attach:port_anchors.png]]
976 -
977 -== Thoroughness ==
978 -
979 -
980 -
981 -{{id name="thoroughness"/}}
982 -
983 -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 -10751020
1 +7111098
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/10751020/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