<
From version < 15.1 >
edited by cds
on 2014/03/14 14:42
To version < 17.1 >
edited by cds
on 2014/03/14 15:21
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -783,10 +783,10 @@
783 783  
784 784  {{id name="mergeEdges"/}}
785 785  
786 -{{warning}}
787 -Document!
788 -{{/warning}}
786 +In the KGraph model, edges can either connect to nodes through ports or directly. In the latter case, KLay Layered will introduce a virtual port for each edge, which results in all edges connecting to the node at different points in the final drawing. If this option is switched on, KLay Layered will only generate up to one input and one output port for each node. The option is set on a parent node and applies to all of its children, but not to the parent node itself.
789 789  
788 +[[image:attach:merging.png]]
789 +
790 790  == Merge Hierarchy-Crossing Edges ==
791 791  
792 792  
... ... @@ -803,10 +803,15 @@
803 803  
804 804  {{id name="nodeLayering"/}}
805 805  
806 -{{warning}}
807 -Document!
808 -{{/warning}}
806 +Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
809 809  
808 +* NETWORK_SIMPLEX
809 +This algorithm tries to minimize the length of edges. This is the most computationally intensive algorithm. The number of iterations after which it aborts if it hasn't found a result yet can be set with the [[Maximal Iterations>>doc:||anchor="maximalInterations"]] option.
810 +* LONGEST_PATH
811 +A very simple algorithm that distributes nodes along their longest path to a sink node.
812 +* INTERACTIVE
813 +Distributes the nodes into layers by comparing their positions before the layout algorithm was started. The idea is that the relative horizontal order of nodes as it was before layout was applied is not changed. This of course requires valid positions for all nodes to have been set on the input graph before calling the layout algorithm. The interactive node layering algorithm uses the //Interactive Reference Point// option to determine which reference point of nodes are used to compare positions.
814 +
810 810  == Node Placement ==
811 811  
812 812  
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9470051
1 +9470076
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470051/KLay Layered Layout Options
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470076/KLay Layered Layout Options