Changes for page KIML Layout Options

Last modified by Alexander Schulz-Rosengarten on 2023/09/11 16:17

From version 19.1
edited by msp
on 2014/03/08 20:04
Change comment: There is no comment for this version
To version 31.1
edited by csp
on 2015/02/18 12:54
Change comment: There is no comment for this version

Summary

Details

Page properties
Parent
... ... @@ -1,0 +1,1 @@
1 +Infrastructure for Meta Layout (KIML)
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.msp
1 +XWiki.csp
Content
... ... @@ -1,8 +1,6 @@
1 -{{warning}}
2 -This is preliminary and incomplete documentation. You've been warned.
3 -{{/warning}}
1 +
4 4  
5 -KIML defines a whole set of standard layout options that many layout algorithms support. Whether an algorithm supports a layout option depends on the option and on the algorithm. When an option is supported by an algorithm, that algorithm may override the option's default value. Algorithms may also provide more specialized documentation for layout options.
3 +KIML defines a whole set of standard layout options that many layout algorithms support. When an option is supported by an algorithm, that algorithm may override the option's default value. Algorithms may also provide more specialized documentation for layout options.
6 6  
7 7  **Contents**
8 8  
... ... @@ -37,7 +37,7 @@
37 37  Default
38 38  )))
39 39  |(((
40 -Alignment
38 +[[Alignment>>doc:||anchor="alignment"]]
41 41  )))|(((
42 42  de.cau.cs.kieler.alignment
43 43  )))|(((
... ... @@ -48,7 +48,7 @@
48 48  AUTOMATIC
49 49  )))
50 50  |(((
51 -Aspect Ratio
49 +[[Aspect Ratio>>doc:||anchor="aspectRatio"]]
52 52  )))|(((
53 53  de.cau.cs.kieler.aspectRatio
54 54  )))|(((
... ... @@ -148,7 +148,7 @@
148 148  
149 149  )))
150 150  |(((
151 -Layout Hierarchy
149 +[[Layout Hierarchy>>doc:||anchor="layoutHierarchy"]]
152 152  )))|(((
153 153  de.cau.cs.kieler.layoutHierarchy
154 154  )))|(((
... ... @@ -181,6 +181,7 @@
181 181  )))|(% colspan="1" %)(% colspan="1" %)
182 182  (((
183 183  Nodes
182 +Labels
184 184  )))|(% colspan="1" %)(% colspan="1" %)
185 185  (((
186 186  
... ... @@ -214,7 +214,7 @@
214 214  )))
215 215  |(% colspan="1" %)(% colspan="1" %)
216 216  (((
217 -Port Spacing
216 +[[Port Spacing>>doc:||anchor="portSpacing"]]
218 218  )))|(% colspan="1" %)(% colspan="1" %)
219 219  (((
220 220  de.cau.cs.kieler.portSpacing
... ... @@ -228,6 +228,91 @@
228 228  (((
229 229  
230 230  )))
230 +|(% colspan="1" %)(% colspan="1" %)
231 +(((
232 +[[Port Alignment>>doc:||anchor="portAlignment"]]
233 +)))|(% colspan="1" %)(% colspan="1" %)
234 +(((
235 +de.cau.cs.kieler.portAlignment
236 +)))|(% colspan="1" %)(% colspan="1" %)
237 +(((
238 +Enum
239 +)))|(% colspan="1" %)(% colspan="1" %)
240 +(((
241 +Nodes
242 +Parents
243 +)))|(% colspan="1" %)(% colspan="1" %)
244 +(((
245 +JUSTIFIED
246 +)))
247 +|(% colspan="1" %)(% colspan="1" %)
248 +(((
249 +Port Alignment for Northern Ports
250 +)))|(% colspan="1" %)(% colspan="1" %)
251 +(((
252 +de.cau.cs.kieler.portAlignment.north
253 +)))|(% colspan="1" %)(% colspan="1" %)
254 +(((
255 +Enum
256 +)))|(% colspan="1" %)(% colspan="1" %)
257 +(((
258 +Nodes
259 +Parents
260 +)))|(% colspan="1" %)(% colspan="1" %)
261 +(((
262 +UNDEFINED
263 +)))
264 +|(% colspan="1" %)(% colspan="1" %)
265 +(((
266 +Port Alignment for Souther Ports
267 +)))|(% colspan="1" %)(% colspan="1" %)
268 +(((
269 +de.cau.cs.kieler.portAlignment.south
270 +)))|(% colspan="1" %)(% colspan="1" %)
271 +(((
272 +Enum
273 +)))|(% colspan="1" %)(% colspan="1" %)
274 +(((
275 +Nodes
276 +Parents
277 +)))|(% colspan="1" %)(% colspan="1" %)
278 +(((
279 +UNDEFINED
280 +)))
281 +|(% colspan="1" %)(% colspan="1" %)
282 +(((
283 +Port Alignment for Eastern Ports
284 +)))|(% colspan="1" %)(% colspan="1" %)
285 +(((
286 +de.cau.cs.kieler.portAlignment.east
287 +)))|(% colspan="1" %)(% colspan="1" %)
288 +(((
289 +Enum
290 +)))|(% colspan="1" %)(% colspan="1" %)
291 +(((
292 +Nodes
293 +Parents
294 +)))|(% colspan="1" %)(% colspan="1" %)
295 +(((
296 +UNDEFINED
297 +)))
298 +|(% colspan="1" %)(% colspan="1" %)
299 +(((
300 +Port Alignment for Western Ports
301 +)))|(% colspan="1" %)(% colspan="1" %)
302 +(((
303 +de.cau.cs.kieler.portAlignment.west
304 +)))|(% colspan="1" %)(% colspan="1" %)
305 +(((
306 +Enum
307 +)))|(% colspan="1" %)(% colspan="1" %)
308 +(((
309 +Nodes
310 +Parents
311 +)))|(% colspan="1" %)(% colspan="1" %)
312 +(((
313 +UNDEFINED
314 +)))
231 231  |(((
232 232  Position
233 233  )))|(((
... ... @@ -351,6 +351,22 @@
351 351  )))
352 352  |(% colspan="1" %)(% colspan="1" %)
353 353  (((
438 +[[Additional Port Space>>doc:||anchor="addPortSpace"]]
439 +)))|(% colspan="1" %)(% colspan="1" %)
440 +(((
441 +de.cau.cs.kieler.additionalPortSpace
442 +)))|(% colspan="1" %)(% colspan="1" %)
443 +(((
444 +Margins
445 +)))|(% colspan="1" %)(% colspan="1" %)
446 +(((
447 +Nodes
448 +)))|(% colspan="1" %)(% colspan="1" %)
449 +(((
450 +0, 0, 0, 0
451 +)))
452 +|(% colspan="1" %)(% colspan="1" %)
453 +(((
354 354  Animate
355 355  )))|(% colspan="1" %)(% colspan="1" %)
356 356  (((
... ... @@ -383,7 +383,7 @@
383 383  )))
384 384  |(% colspan="1" %)(% colspan="1" %)
385 385  (((
386 -Comment Box
486 +[[Comment Box>>doc:||anchor="commentBox"]]
387 387  )))|(% colspan="1" %)(% colspan="1" %)
388 388  (((
389 389  de.cau.cs.kieler.commentBox
... ... @@ -469,7 +469,7 @@
469 469  )))
470 470  |(% colspan="1" %)(% colspan="1" %)
471 471  (((
472 -Hypernode
572 +[[Hypernode>>doc:||anchor="hypernode"]]
473 473  )))|(% colspan="1" %)(% colspan="1" %)
474 474  (((
475 475  de.cau.cs.kieler.hypernode
... ... @@ -567,7 +567,7 @@
567 567  )))
568 568  |(% colspan="1" %)(% colspan="1" %)
569 569  (((
570 -No Layout
670 +[[No Layout>>doc:||anchor="noLayout"]]
571 571  )))|(% colspan="1" %)(% colspan="1" %)
572 572  (((
573 573  de.cau.cs.kieler.noLayout
... ... @@ -583,6 +583,22 @@
583 583  )))
584 584  |(% colspan="1" %)(% colspan="1" %)
585 585  (((
686 +[[Port Anchor Offset>>doc:||anchor="portAnchor"]]
687 +)))|(% colspan="1" %)(% colspan="1" %)
688 +(((
689 +de.cau.cs.kieler.klay.layered.portAnchor
690 +)))|(% colspan="1" %)(% colspan="1" %)
691 +(((
692 +Object
693 +)))|(% colspan="1" %)(% colspan="1" %)
694 +(((
695 +Ports
696 +)))|(% colspan="1" %)(% colspan="1" %)
697 +(((
698 +
699 +)))
700 +|(% colspan="1" %)(% colspan="1" %)
701 +(((
586 586  Port Index
587 587  )))|(% colspan="1" %)(% colspan="1" %)
588 588  (((
... ... @@ -663,6 +663,22 @@
663 663  )))
664 664  |(% colspan="1" %)(% colspan="1" %)
665 665  (((
782 +Thickness
783 +)))|(% colspan="1" %)(% colspan="1" %)
784 +(((
785 +de.cau.cs.kieler.thickness
786 +)))|(% colspan="1" %)(% colspan="1" %)
787 +(((
788 +Float
789 +)))|(% colspan="1" %)(% colspan="1" %)
790 +(((
791 +Edges
792 +)))|(% colspan="1" %)(% colspan="1" %)
793 +(((
794 +1.0
795 +)))
796 +|(% colspan="1" %)(% colspan="1" %)
797 +(((
666 666  Zoom to Fit
667 667  )))|(% colspan="1" %)(% colspan="1" %)
668 668  (((
... ... @@ -714,27 +714,23 @@
714 714  
715 715  = Detailed Documentation =
716 716  
849 +This section explains every layout option in more detail.
850 +
717 717  == The Most Important Options ==
718 718  
719 719  While most layout options are used to affect how the active layout algorithm computes concrete coordinates for the graph elements, there are some layout options that have a special role in KIML.
720 720  
721 -=== Layout Algorithm ===
855 +=== ===
722 722  
723 -{{id name="layoutAlgorithm"/}}
857 +{{id name="layoutAlgorithm"/}}Layout AlgorithmThe option with identifier {{code language="none"}}de.cau.cs.kieler.algorithm{{/code}} specifies which layout algorithm to use for a graph or subgraph. The value can be either the identifier of a layout algorithm or the identifier of a layout type. In the latter case the algorithm with highest priority of that type is applied. It is possible to set different values for this option on subgraphs of a hierarchical graph, where a subgraph is identified by a parent node. A layout algorithm is responsible to process only the direct content of a given parent node. An exception from this rule is made when the [[Layout Hierarchy>>doc:||anchor="layoutHierarchy"]] option is active.
724 724  
725 -The option with identifier {{code language="none"}}de.cau.cs.kieler.algorithm{{/code}} specifies which layout algorithm to use for the content of a composite node. The value can be either the identifier of a layout algorithm or the identifier of a layout type. In the latter case the algorithm with highest priority of that type is applied.
859 +The following layout has been created by setting a force-based layout algorithm on the inner hierarchy level and a layer-based layout algorithm on the top level.
726 726  
727 -The following layout types are predefined:
861 +[[image:attach:layout_algorithm.png]]
728 728  
729 -* **Layered** - The layer-based method emphasizes the direction of edges by pointing as many edges as possible into the same direction. The nodes are arranged in layers and then reordered such that the number of edge crossings is minimized. Afterwards, concrete coordinates are computed for the nodes and edge bend points.
730 -* **Orthogonal** - Orthogonal methods follow the "topology-shape-metrics" approach, which first applies a planarization technique, resulting in a planar representation of the graph, then compute an orthogonal shape, and finally determine concrete coordinates for nodes and edge bend points by applying a compaction method.
731 -* **Force** - Layout algorithms that follow physical analogies by simulating a system of attractive and repulsive forces.
732 -* **Circular** - Circular layout algorithms emphasize biconnected components of a graph by arranging them in circles. This is useful if a drawing is desired where such components are clearly grouped, or where cycles are shown as prominent properties of the graph.
733 -* **Tree** - Specialized layout methods for trees, i.e. acyclic graphs. The regular structure of graphs that have no undirected cycles can be emphasized using an algorithm of this type.
863 +==== Available Algorithms and Libraries ====
734 734  
735 -=== Available Algorithms and Libraries ===
736 -
737 -* **The [[KLay Project>>doc:Layout Algorithms (KLay)]]** - Java implementations of standard layout approaches, augmented with special processing of graph features such as ports and edge labels.
865 +* **The [[KLay Project>>doc:Layout Algorithms (KLay)]]** - Java implementations of standard layout approaches, augmented with special processing of graph features such as ports and labels.
738 738  * **Randomizer** - Distributes the nodes randomly; not very useful, but it can show how important a good layout is for understanding a graph.
739 739  * (((
740 740  **Box Layout** - Ignores edges, places all nodes in rows. Can be used to layout collections of unconnected boxes, such as Statechart regions.
... ... @@ -743,54 +743,130 @@
743 743  * **OGDF** ((% style="color: rgb(0,0,0);" %)[[www.ogdf.net>>url:http://www.ogdf.net/||shape="rect"]](%%)) - A self-contained C++ class library for the automatic layout of diagrams. The version that is shipped with KIELER is compiled as an executable that reads files in OGML format and outputs the computed concrete layout.
744 744  * **Graphviz** ([[www.graphviz.org>>url:http://www.graphviz.org/||shape="rect"]]) - An open source graph visualization tool with several graph layout programs, web and interactive graphical interfaces, auxiliary tools, libraries, and language bindings. Graphviz needs to be installed separately in order to be used within KIELER, since it is called in a separate process using the DOT language for communication.
745 745  
746 -=== Diagram Type ===
874 +==== Predefined Layout Types ====
747 747  
748 -{{id name="diagramType"/}}
876 +* **Layered** - The layer-based method emphasizes the direction of edges by pointing as many edges as possible into the same direction. The nodes are arranged in layers and then reordered such that the number of edge crossings is minimized. Afterwards, concrete coordinates are computed for the nodes and edge bend points.
877 +* **Orthogonal** - Orthogonal methods follow the "topology-shape-metrics" approach, which first applies a planarization technique, resulting in a planar representation of the graph, then compute an orthogonal shape, and finally determine concrete coordinates for nodes and edge bend points by applying a compaction method.
878 +* **Force** - Layout algorithms that follow physical analogies by simulating a system of attractive and repulsive forces.
879 +* **Circular** - Circular layout algorithms emphasize biconnected components of a graph by arranging them in circles. This is useful if a drawing is desired where such components are clearly grouped, or where cycles are shown as prominent properties of the graph.
880 +* **Tree** - Specialized layout methods for trees, i.e. acyclic graphs. The regular structure of graphs that have no undirected cycles can be emphasized using an algorithm of this type.
749 749  
750 -Diagram types are used to classify graphical diagrams for setting default layout option values for a set of similar diagrams. The diagram type of an element is specified with the layout option {{code language="none"}}de.cau.cs.kieler.diagramType{{/code}}. Layout algorithms can declare which diagram types they support well, and give a priority value for each supported type. KIML decides at runtime which layout algorithm has the highest priority for a given diagram, so that the most suitable algorithm is always used. Usual values for such priorities are between 1 and 10, where the highest value should only be assigned if the algorithm is especially designed for diagrams of the respective type, or if it has proven to be very adequate for them. Lower values should be given if the algorithm is able to draw the diagrams correctly, but with lower quality of the resulting layout.
882 +=== ===
751 751  
884 +{{id name="diagramType"/}}Diagram TypeDiagram types are used to classify graphical diagrams for setting default layout option values for a set of similar diagrams. The diagram type of an element is specified with the layout option {{code language="none"}}de.cau.cs.kieler.diagramType{{/code}}. Layout algorithms can declare which diagram types they support well, and give a priority value for each supported type. KIML decides at runtime which layout algorithm has the highest priority for a given diagram, so that the most suitable algorithm is always used. Usual values for such priorities are between 1 and 10, where the highest value should only be assigned if the algorithm is especially designed for diagrams of the respective type, or if it has proven to be very adequate for them. Lower values should be given if the algorithm is able to draw the diagrams correctly, but with lower quality of the resulting layout.
885 +
752 752  The following diagram types are predefined:
753 753  
754 754  * **General** - This type is automatically assigned to all diagrams for which no specific type is declared. A layout algorithm that has the highest priority on the //General// diagram type is taken as the default algorithm when no further information on a diagram is available to KIML.
755 -* **State Machine** - All kinds of state machines, automata, and activity diagrams. Examples: [[doc:SCCharts SyncCharts]], UML Activity diagrams.
889 +* **State Machine** - All kinds of state machines, automata, and activity diagrams. Examples: [[doc:SyncCharts]], UML Activity diagrams.
756 756  * **Data Flow Diagram** - Actor-oriented diagrams, where connections are mostly done between //ports// of nodes. These diagrams can only be handled properly by very special layout algorithms, such as those developed in the [[KLay project>>doc:Layout Algorithms (KLay)]].
757 757  * **Class Diagram** - Class diagrams such as Ecore diagrams for the [[EMF>>url:http://www.eclipse.org/modeling/emf/||shape="rect"]] or UML Class diagrams.
758 758  * **Use Case Diagram** - Use case diagrams as defined by the UML.
759 -* **Unconnected Boxes** - Sets of nodes that have no connections and are treated as resizable boxes. This is related to mathematical [[packing problems>>url:http://en.wikipedia.org/wiki/Packing_problem||shape="rect"]]. Example: Regions in [[doc:SCCharts SyncCharts]].
893 +* **Unconnected Boxes** - Sets of nodes that have no connections and are treated as resizable boxes. This is related to mathematical [[packing problems>>url:http://en.wikipedia.org/wiki/Packing_problem||shape="rect"]]. Example: Regions in [[doc:SyncCharts]].
760 760  
895 +=== ===
896 +
897 +{{id name="edgeRouting"/}}Edge RoutingThis option influences the way in which edges are routed between the nodes they connect. The following settings are available:
898 +
899 +* POLYLINE
900 +Edges consist of one or more segments defined by a list of bend points.
901 +* ORTHOGONAL
902 +Edges are routed orthogonally, meaning that each segment of an edge runs either horizontally or vertically.
903 +* SPLINES
904 +Edges are routed as splines (smooth curves).
905 +* UNDEFINED
906 +No particular edge routing style is selected. Usually this value points to the default setting of the selected layout algorithm.
907 +
908 +[[image:attach:edge_routing.png]]
909 +
910 +When used as layout option, the edge routing is set for a whole graph or subgraph, i.e. on a parent node. However, the property is additionally used for the output of the layout algorithm in order to mark individual edges. If the edge routing assigned to an edge is anything other than SPLINES, the bend points of that edge are interpreted with their normal meaning, i.e. straight lines are drawn between consecutive bend points. If, on the other hand, a layout algorithm marks an edge with the value SPLINES, the bend points have to be interpreted as control points for a series of cubic splines following this procedure:
911 +
912 +1. Start at the source point of the edge.
913 +1. As long as there are at least three bend points left:
914 +11. Draw a cubic spline segment to the third bend point with the other two bend points as control points.
915 +11. Use the third bend point as start point for the next segment.
916 +11. Consume the three bend points and proceed to the next segment.
917 +1. Check the number of remaining bend points:
918 +11. Two bend points – draw a cubic spline segment to the target point of the edge.
919 +11. One bend point – draw a quadratic spline segment to the target point of the edge.
920 +11. No bend point – draw a straight line to the target point of the edge.
921 +
761 761  == Other Options ==
762 762  
763 -* **Layout Hierarchy** ({{code language="none"}}de.cau.cs.kieler.layoutHierarchy{{/code}}) - If this option is supported and active, the layout algorithm is requested to process the full hierarchy contained in the input node. This means that instead of executing another algorithm on each hierarchy level, all levels are arranged in a single algorithm execution.
764 -* **Hypernode** ({{code language="none"}}de.cau.cs.kieler.hypernode{{/code}}) - A node that is marked as hypernode has a special role in the graph structure, since all its incident edges are treated as parts of the same [[hyperedge>>url:http://en.wikipedia.org/wiki/Hypergraph||shape="rect"]]. Example: relation vertices in [[Ptolemy>>url:http://ptolemy.eecs.berkeley.edu/||shape="rect"]] models.
765 -* **Comment Box** ({{code language="none"}}de.cau.cs.kieler.commentBox{{/code}}) - A node that is marked as comment box is treated as a label that needs to be placed somewhere. This is different to normal node labels, which are usually regarded as fixed.
766 -* **No Layout** ({{code language="none"}}de.cau.cs.kieler.noLayout{{/code}}) - Elements that are marked with this option are excluded from layout. This is used to identify diagram objects that should not be regarded as graph elements.
924 +=== ===
767 767  
768 -This section explains every layout option in more detail.
926 +{{id name="addPortSpace"/}}Additional Port SpaceThis option controls the usable space for ports on each side:
769 769  
770 -=== Edge Routing ===
928 +[[image:attach:addPortSpace.png]]
771 771  
772 -{{id name="edgeRouting"/}}
930 +If the option is not set, the value of [[Port Spacing>>doc:||anchor="portSpacing"]] is used instead for all four components.
773 773  
774 -This option influences the way in which edges are routed between the nodes they connect. The following settings are available:
932 +This option is only relevant if port constraints are {{code language="none"}}FREE{{/code}}, {{code language="none"}}FIXED_SIDE{{/code}}, or {{code language="none"}}FIXED_ORDER{{/code}}. If size constraints include {{code language="none"}}PORTS{{/code}}, the additional port space, together with the port spacing and the size of ports, determines a lower bound on the node size.
775 775  
776 -* POLYLINE
777 -Edges consist of one or more segments defined by a list of bend points.
778 -* ORTHOGONAL
779 -Edges are routed orthogonally, meaning that each segment of an edge runs either horizontally or vertically, but never at an angle.
780 -* SPLINE
781 -Edges are routed as splines (smooth curves). (% style="color: rgb(153,51,0);" %)**TODO:** Add more documentation on how the returned bend points are to be interpreted.
782 -* UNDEFINED
783 -No particular edge routing style is selected. The result produced by the layout algorithm may be undefined.
934 +=== ===
784 784  
785 -(% style="color: rgb(153,51,0);" %)**TODO:** Add an image illustrating the different routing styles.
936 +{{id name="alignment"/}}AlignmentDetermines the alignment of a node in relation to other nodes of the same row or column. For layer-based algorithms, for instance, this option controls how a node is positioned inside its assigned layer.
786 786  
787 -=== Port Offset ===
938 +=== ===
788 788  
789 -{{id name="portOffset"/}}
940 +{{id name="aspectRatio"/}}Aspect RatioThe aspect ratio of a drawing is the ratio of its total width to its total height. This option gives some control over that ratio, although in most cases it is only interpreted as a hint on how to arrange multiple connected components, hence the actual aspect ratio will probably be different from what has been specified with the option.
790 790  
791 -The port offset is used to specify how much space a layout algorithm should leave between a port and the border of its node. This is usually zero, but doesn't have to be. If the offset is not defined for a given port, a layout algorithm can try to infer the offset from the port's coordinates and its node's size in the input graph. This of course requires both properties to be set to sensible values.
942 +=== ===
792 792  
944 +{{id name="commentBox"/}}Comment BoxA node that is marked as comment box is treated as a label that needs to be placed somewhere. In contrast to normal node labels (modeled with a KLabel instance), comment boxes may have connections to other nodes, as in the following example.
945 +
946 +[[image:attach:comment_box.png]]
947 +
948 +=== ===
949 +
950 +{{id name="hypernode"/}}HypernodeA node that is marked as hypernode has a special role in the graph structure, since all its incident edges are treated as parts of the same [[hyperedge>>url:http://en.wikipedia.org/wiki/Hypergraph||shape="rect"]]. Example: relation vertices in [[Ptolemy>>url:http://ptolemy.eecs.berkeley.edu/||shape="rect"]] models.
951 +
952 +=== ===
953 +
954 +{{id name="layoutHierarchy"/}}Layout HierarchyIf this option is supported and active, the layout algorithm is requested to process the full hierarchy contained in the input node. This means that instead of executing another algorithm on each hierarchy level, all levels are arranged in a single algorithm execution.
955 +
956 +=== ===
957 +
958 +{{id name="noLayout"/}}No LayoutElements that are marked with this option are excluded from layout. This is used to identify diagram objects that should not be regarded as graph elements.
959 +
960 +=== ===
961 +
962 +{{id name="portAlignment"/}}Port AlignmentThe port alignment controls how ports are distributed over their respective edge.
963 +
964 +This option is only relevant if port constraints are {{code language="none"}}FREE{{/code}}, {{code language="none"}}FIXED_SIDE{{/code}}, or {{code language="none"}}FIXED_ORDER{{/code}}.
965 +
966 +The following settings are possible:
967 +
968 +* {{code language="none"}}UNDEFINED{{/code}}
969 +Defaults to {{code language="none"}}JUSTIFIED{{/code}}.
970 +* {{code language="none"}}JUSTIFIED{{/code}}
971 +Distributes the ports evenly over the whole usable space (for usable space, see [[additional port space>>doc:||anchor="addPortSpace"]]).
972 +* {{code language="none"}}BEGIN{{/code}}
973 +Places the ports at top-/leftmost position with [[port spacing>>doc:||anchor="portSpacing"]] between them.
974 +* {{code language="none"}}CENTER{{/code}}
975 +Places the ports centered in the usable space with port spacing between them.
976 +* {{code language="none"}}END{{/code}}
977 +Places the ports at bottom-/rightmost position with port spacing between them.
978 +
979 +Port alignment can also be set as specialized options {{code language="none"}}portAlignment.{north|south|east|west{{/code}}}. These options overwrite the general policy for the respective side. Setting one of these to {{code language="none"}}UNDEFINED{{/code}} defaults it to the general port alignment.
980 +
981 +=== ===
982 +
983 +{{id name="portAnchor"/}}Port Anchor OffsetSince 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.
984 +
985 +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:
986 +
987 +[[image:attach:KLay Layered Layout Options@port_anchors.png]]
988 +
989 +=== ===
990 +
991 +{{id name="portOffset"/}}Port OffsetThe port offset is used to specify how much space a layout algorithm should leave between a port and the border of its node. This is usually zero, but doesn't have to be. If the offset is not defined for a given port, a layout algorithm can try to infer the offset from the port's coordinates and its node's size in the input graph. This of course requires both properties to be set to sensible values.
992 +
793 793  Set this property if one of the following cases applies:
794 794  
795 795  * The port constraints on a node are set to FREE, FIXED_SIDES or FIXED_ORDER.
796 796  * The port constraints on a node are set to FIXED_RATIO or FIXED_POS, and the size of the node is not fixed. (Note that this is especially true for ports of compound nodes.)
997 +
998 +=== ===
999 +
1000 +{{id name="portSpacing"/}}Port SpacingThe port spacing determines how much space KLay Layered should leave between the ports of each side. This option is only relevant if the node size depends on the ports, that is, if the size constraints include {{code language="none"}}SizeConstraint.PORTS{{/code}}.
addPortSpace.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +20.2 KB
Content
comment_box.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +5.5 KB
Content
edge_routing.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +57.8 KB
Content
layout_algorithm.png
Author
... ... @@ -1,0 +1,1 @@
1 +XWiki.XWikiGuest
Size
... ... @@ -1,0 +1,1 @@
1 +20.0 KB
Content
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9470012
1 +7111094
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470012/KIML Layout Options
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/7111094/KIML Layout Options