<
From version < 16.1 >
edited by cds
on 2014/03/14 15:09
To version < 18.1 >
edited by cds
on 2014/03/17 11:21
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -480,6 +480,25 @@
480 480  )))
481 481  |(% colspan="1" %)(% colspan="1" %)
482 482  (((
483 +Edge Label Side Selection
484 +)))|(% colspan="1" %)(% colspan="1" %)
485 +(((
486 +de.cau.cs.kieler.klay.layered.edgeLabelSideSelection
487 +)))|(% colspan="1" %)(% colspan="1" %)
488 +(((
489 +Enum
490 +)))|(% colspan="1" %)(% colspan="1" %)
491 +(((
492 +Parents
493 +)))|(% colspan="1" %)(% colspan="1" %)
494 +(((
495 +SMART
496 +)))|(% colspan="1" %)(% colspan="1" %)
497 +(((
498 +
499 +)))
500 +|(% colspan="1" %)(% colspan="1" %)
501 +(((
483 483  [[Feedback Edges>>doc:||anchor="feedbackEdges"]]
484 484  )))|(% colspan="1" %)(% colspan="1" %)
485 485  (((
... ... @@ -803,10 +803,15 @@
803 803  
804 804  {{id name="nodeLayering"/}}
805 805  
806 -{{warning}}
807 -Document!
808 -{{/warning}}
825 +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  
827 +* NETWORK_SIMPLEX
828 +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.
829 +* LONGEST_PATH
830 +A very simple algorithm that distributes nodes along their longest path to a sink node.
831 +* INTERACTIVE
832 +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.
833 +
810 810  == Node Placement ==
811 811  
812 812  
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9470053
1 +9470079
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470053/KLay Layered Layout Options
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470079/KLay Layered Layout Options