Last modified by Richard Kreissig on 2023/09/14 10:20
<
From version < 35.1 >
edited by uru
on 2015/01/28 15:16
To version < 49.1
edited by Richard Kreissig
on 2023/09/14 10:20
Change comment: There is no comment for this version

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.uru
1 +XWiki.stu230980
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  )))|(((
... ... @@ -484,7 +484,7 @@
484 484  )))
485 485  |(% colspan="1" %)(% colspan="1" %)
486 486  (((
487 -(% class="confluence-link" %) Content Alignment[[doc:||anchor="contentAlignment"]]
503 +[[Content Alignment>>doc:||anchor="contentAlignment"]]
488 488  )))|(% colspan="1" %)(% colspan="1" %)
489 489  (((
490 490  de.cau.cs.kieler.klay.layered.contentAlignment
... ... @@ -557,7 +557,7 @@
557 557  Parents
558 558  )))|(% colspan="1" %)(% colspan="1" %)
559 559  (((
560 -SMART
576 +ALWAYS_DOWN
561 561  )))|(% colspan="1" %)(% colspan="1" %)
562 562  (((
563 563  
... ... @@ -659,25 +659,6 @@
659 659  )))
660 660  |(% colspan="1" %)(% colspan="1" %)
661 661  (((
662 -[[Maximal Iterations>>doc:||anchor="maximalIterations"]]
663 -)))|(% colspan="1" %)(% colspan="1" %)
664 -(((
665 -de.cau.cs.kieler.klay.layered.nodeLayering
666 -)))|(% colspan="1" %)(% colspan="1" %)
667 -(((
668 -Int
669 -)))|(% colspan="1" %)(% colspan="1" %)
670 -(((
671 -Parents
672 -)))|(% colspan="1" %)(% colspan="1" %)
673 -(((
674 -10.000.000
675 -)))|(% colspan="1" %)(% colspan="1" %)
676 -(((
677 -nodeLayering=NETWORK_SIMPLEX
678 -)))
679 -|(% colspan="1" %)(% colspan="1" %)
680 -(((
681 681  [[Merge Edges>>doc:||anchor="mergeEdges"]]
682 682  )))|(% colspan="1" %)(% colspan="1" %)
683 683  (((
... ... @@ -747,25 +747,6 @@
747 747  (((
748 748  
749 749  )))
750 -|(% colspan="1" %)(% colspan="1" %)
751 -(((
752 -[[Port Anchor Offset>>doc:||anchor="portAnchor"]]
753 -)))|(% colspan="1" %)(% colspan="1" %)
754 -(((
755 -de.cau.cs.kieler.klay.layered.portAnchor
756 -)))|(% colspan="1" %)(% colspan="1" %)
757 -(((
758 -Object
759 -)))|(% colspan="1" %)(% colspan="1" %)
760 -(((
761 -Ports
762 -)))|(% colspan="1" %)(% colspan="1" %)
763 -(((
764 -
765 -)))|(% colspan="1" %)(% colspan="1" %)
766 -(((
767 -
768 -)))
769 769  |(((
770 770  [[Thoroughness>>doc:||anchor="thoroughness"]]
771 771  )))|(((
... ... @@ -775,7 +775,7 @@
775 775  )))|(((
776 776  Parents
777 777  )))|(((
778 -7
756 +10
779 779  )))|(% colspan="1" %)(% colspan="1" %)
780 780  (((
781 781  
... ... @@ -783,101 +783,67 @@
783 783  
784 784  = Detailed Documentation =
785 785  
786 -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.
787 787  
788 -== Add Unnecessary Bendpoints ==
766 +== ==
789 789  
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.
790 790  
770 +== ==
791 791  
792 -{{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.
793 793  
794 -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.
795 -
796 -== Content Alignment ==
797 -
798 -
799 -
800 -{{id name="contentAlignment"/}}
801 -
802 -Determines how the content of compound nodes is to be aligned if the compound node's size exceeds the bounding box of the content (i.e. child nodes). This might be the case if for a compound node the size constraint of {{code language="none"}}MINIMUM_SIZE{{/code}} is set and the minimum width and height are set large enough.
803 -
804 -{{note}}
774 +{{info}}
805 805  This option is not tested for external ports with port constraints {{code language="none"}}FIXED_RATIO{{/code}} or {{code language="none"}}FIXED_POS{{/code}}.
806 -{{/note}}
776 +{{/info}}
807 807  
808 -
778 +== ==
809 809  
810 -== Crossing Minimization ==
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:
811 811  
812 -
813 -
814 -{{id name="crossingMinimization"/}}
815 -
816 -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:
817 -
818 -* LAYER_SWEEP
782 +* {{code language="none"}}LAYER_SWEEP{{/code}}
819 819  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.
820 -* INTERACTIVE
784 +* {{code language="none"}}INTERACTIVE{{/code}}
821 821  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.
822 822  
823 -== Cycle Breaking ==
787 +== ==
824 824  
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:
825 825  
826 -
827 -{{id name="cycleBreaking"/}}
828 -
829 -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:
830 -
831 -* GREEDY
791 +* {{code language="none"}}GREEDY{{/code}}
832 832  This algorithm reverses edges greedily. The algorithm tries to avoid edges that have the //Priority// property set.
833 -* INTERACTIVE
793 +* {{code language="none"}}INTERACTIVE{{/code}}
834 834  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.
835 835  
836 -== Direction ==
796 +== ==
837 837  
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}}.
838 838  
800 +== ==
839 839  
840 -{{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.
841 841  
842 -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}}.
843 -
844 -== Edge Spacing Factor ==
845 -
846 -
847 -
848 -{{id name="edgeSpacingFactor"/}}
849 -
850 -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.
851 -
852 852  [[image:attach:edgeSpacingFactor.png]]
853 853  
854 -== Edge Label Side Selection ==
806 +== ==
855 855  
808 +{{id name="edgeLabelSideSelection"/}}Edge Label Side SelectionDetermines how KLay Layered places edge labels. The following strategies are available:
856 856  
857 -
858 -{{id name="edgeLabelSideSelection"/}}
859 -
860 -Determines how KLay Layered places edge labels. The following strategies are available:
861 -
862 -* ALWAYS_UP
810 +* {{code language="none"}}ALWAYS_UP{{/code}}
863 863  Always places edge labels above the edge.
864 -* ALWAYS_DOWN
812 +* {{code language="none"}}ALWAYS_DOWN{{/code}}
865 865  Always places edge labels below the edge.
866 -* DIRECTION_UP
814 +* {{code language="none"}}DIRECTION_UP{{/code}}
867 867  Places edge labels above edges pointing right, and below edges pointing left.
868 -* DIRECTION_DOWN
816 +* {{code language="none"}}DIRECTION_DOWN{{/code}}
869 869  Places edge labels below edges pointing right, and above edges pointing left.
870 -* SMART
818 +* {{code language="none"}}SMART{{/code}}
871 871  Uses a heuristic that determines the best edge label placement, also taking the placement of port labels into account.
872 872  
873 -== Feedback Edges ==
821 +== ==
874 874  
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.
875 875  
876 -
877 -{{id name="feedbackEdges"/}}
878 -
879 -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.
880 -
881 881  With feedback edges:
882 882  
883 883  [[image:attach:feedback_on.png]]
... ... @@ -886,131 +886,81 @@
886 886  
887 887  [[image:attach:feedback_off.png]]
888 888  
889 -== Fixed Alignment ==
833 +== ==
890 890  
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.
891 891  
892 -
893 -{{id name="fixedAlignment"/}}
894 -
895 -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.
896 -
897 897  This option should usually be left alone.
898 898  
899 -== Interactive Reference Point ==
839 +== ==
900 900  
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:
901 901  
902 -
903 -{{id name="interactiveReferencePoint"/}}
904 -
905 -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:
906 -
907 -* TOP_LEFT
843 +* {{code language="none"}}TOP_LEFT{{/code}}
908 908  The top left corner of a node is taken as the reference point.
909 -* CENTER
845 +* {{code language="none"}}CENTER{{/code}}
910 910  The center of a node is taken as the reference point.
911 911  
912 -== Layer Constraint ==
848 +== ==
913 913  
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.
914 914  
915 -
916 -{{id name="layerConstraint"/}}
917 -
918 -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.
919 -
920 920  [[image:attach:layer_constraints.png]]
921 921  
922 -{{note}}
854 +{{info}}
923 923  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.
924 -{{/note}}
856 +{{/info}}
925 925  
926 -== Linear Segments Deflection Dampening ==
858 +== ==
927 927  
860 +{{id name="deflectionDampening"/}}Linear Segments Deflection Dampening
928 928  
929 -
930 -{{id name="deflectionDampening"/}}
931 -
932 -{{note}}
862 +{{info}}
933 933  This is a very advanced layout option that you normally shouldn't worry about.
934 -{{/note}}
864 +{{/info}}
935 935  
936 936  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.
937 937  
938 -== Maximal Iterations ==
868 +== ==
939 939  
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.
940 940  
872 +== ==
941 941  
942 -{{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.
943 943  
944 -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.
945 -
946 -== Merge Edges ==
947 -
948 -
949 -
950 -{{id name="mergeEdges"/}}
951 -
952 -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.
953 -
954 954  [[image:attach:merging.png]]
955 955  
956 -== Merge Hierarchy-Crossing Edges ==
878 +== ==
957 957  
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.
958 958  
959 -
960 -{{id name="mergeHierarchyEdges"/}}
961 -
962 -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.
963 -
964 964  [[image:attach:merge_hierarchy_edges.png]]
965 965  
966 -== Node Layering ==
884 +== ==
967 967  
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:
968 968  
969 -
970 -{{id name="nodeLayering"/}}
971 -
972 -Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
973 -
974 -* NETWORK_SIMPLEX
888 +* {{code language="none"}}NETWORK_SIMPLEX{{/code}}
975 975  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.
976 -* LONGEST_PATH
890 +* {{code language="none"}}LONGEST_PATH{{/code}}
977 977  A very simple algorithm that distributes nodes along their longest path to a sink node.
978 -* INTERACTIVE
892 +* {{code language="none"}}INTERACTIVE{{/code}}
979 979  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.
980 980  
981 -== Node Placement ==
895 +== ==
982 982  
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:
983 983  
984 -
985 -{{id name="nodePlacement"/}}
986 -
987 -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:
988 -
989 -* BRANDES_KOEPF
899 +* {{code language="none"}}BRANDES_KOEPF{{/code}}
990 990  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.
991 -* LINEAR_SEGMENTS
901 +* {{code language="none"}}LINEAR_SEGMENTS{{/code}}
992 992  Computes a balanced placement.
993 -* BUCHHEIM_JUENGER_LEIPERT
994 -Also computes a balanced placement, but a little faster.
995 -* 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}}
996 996  Minimizes the area at the expense of... well, pretty much everything else.
997 997  
998 -== Port Anchor Offset ==
908 +== ==
999 999  
1000 -
1001 -
1002 -{{id name="portAnchor"/}}
1003 -
1004 -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.
1005 -
1006 -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:
1007 -
1008 -[[image:attach:port_anchors.png]]
1009 -
1010 -== Thoroughness ==
1011 -
1012 -
1013 -
1014 -{{id name="thoroughness"/}}
1015 -
1016 -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 -10751024
1 +7111098
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/10751024/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