Skip to Content

Changes for page The Five Phases

Last modified by Alexander Schulz-Rosengarten on 2023/07/11 10:33
From version 15.2
edited by msp
on 2023/07/06 14:36
Change comment: Update document after refactoring.
To version 18.1
edited by Alexander Schulz-Rosengarten
on 2023/07/11 10:33
Change comment: Renamed back-links.

Summary

Details

Page properties
Parent
... ... @@ -1,1 +1,1 @@
1 -KIELER.Home.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.WebHome
1 +Kieler.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.WebHome
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.msp
1 +XWiki.als
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:KIELER.Home.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.Intermediate Processors.WebHome]].
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.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.Intermediate Processors.WebHome]].
2 2  
3 3  == Phase 1: Cycle Removal ==
4 4  
... ... @@ -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:KIELER.Home.Discontinued Projects.Layout Algorithms (KLay).KLay Layered.Layer Sweep Crossing Minimization.WebHome]] 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.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" %)