Skip to Content

Changes for page The Five Phases

Last modified by Alexander Schulz-Rosengarten on 2023/07/11 10:33
From version 11.1
edited by uru
on 2013/05/27 08:43
Change comment: There is no comment for this version
To version 15.2
edited by msp
on 2023/07/06 14:36
Change comment: Update document after refactoring.

Summary

Details

Page properties
Parent
... ... @@ -1,0 +1,1 @@
1 +KIELER.Home.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.WebHome
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.uru
1 +XWiki.msp
Content
... ... @@ -1,4 +1,4 @@
1 -This page describes the algorithm's five main phases and the available implementations. You can find a list and descriptions of the intermediate processors [[over here>>doc:Intermediate Processors]].
1 +This page describes the algorithm's five main phases and the available implementations. You can find a list and descriptions of the intermediate processors [[over here>>doc:KIELER.Home.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.Intermediate Processors.WebHome]].
2 2  
3 3  == Phase 1: Cycle Removal ==
4 4  
... ... @@ -80,7 +80,7 @@
80 80  )))
81 81  |=(% colspan="1" %)(% colspan="1" %)
82 82  (((
83 -
83 +Tests
84 84  )))|(% colspan="1" %)(% colspan="1" %)
85 85  (((
86 86  * The set of layerless nodes is empty.
... ... @@ -120,7 +120,7 @@
120 120  (((
121 121  Implementations
122 122  )))|(((
123 -* {{code language="none"}}LayerSweepCrossingMinmizer{{/code}}. Does several sweeps across the layers, minimizing the crossings between each pair of layers using a barycenter heuristic. Supports node successor constraints and layout groups. Node successor constraints require one node to appear before another node. Layout groups specify sets of nodes whose nodes must not be interleaved. See [[this page>>doc:Layer Sweep Crossing Minimization]] for more information.
123 +* {{code language="none"}}LayerSweepCrossingMinmizer{{/code}}. Does several sweeps across the layers, minimizing the crossings between each pair of layers using a barycenter heuristic. Supports node successor constraints and layout groups. Node successor constraints require one node to appear before another node. Layout groups specify sets of nodes whose nodes must not be interleaved. See [[this page>>doc:KIELER.Home.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.Layer Sweep Crossing Minimization.WebHome]] for more information.
124 124  * {{code language="none"}}InteractiveCrossingMinimizer.{{/code}} Detects the order of nodes according to the current layout, hence it reacts to the user's placement.
125 125  )))
126 126  |=(% colspan="1" %)(% colspan="1" %)
... ... @@ -174,10 +174,11 @@
174 174  ** (((
175 175  Ulrik Brandes and Boris Köpf, Fast and simple horizontal coordinate assignment. In //Proceedings of the 9th International Symposium on Graph Drawing (GD'01)//, LNCS vol. 2265, pp. 33-36, Springer, 2002.
176 176  )))
177 +* {{code language="none"}}InteractiveNodePlacer{{/code}}. Tries to keep the preset 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.
177 177  )))
178 178  |=(% colspan="1" %)(% colspan="1" %)
179 179  (((
180 -
181 +Tests
181 181  )))|(% colspan="1" %)(% colspan="1" %)
182 182  (((
183 183  * The nodes of a layer are strictly ordered with regards to their y coordinate.
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -7111017
1 +884883
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/7111017/The Five Phases
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/884883/The Five Phases