| ... |
... |
@@ -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 below. |
|
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]]. |
| 2 |
2 |
|
| 3 |
3 |
== Phase 1: Cycle Removal == |
| 4 |
4 |
|
| ... |
... |
@@ -74,7 +74,7 @@ |
| 74 |
74 |
|
| 75 |
75 |
=== Current Implementations === |
| 76 |
76 |
|
| 77 |
|
-* [[LayerSweepCrossingMinimizer>>url:https://trac.rtsys.informatik.uni-kiel.de/trac/kieler/wiki/Projects/KLay/Layered/LayerSweepCrossingMinimizer||shape="rect" class="wiki"]]. 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. |
|
77 |
+* [[LayerSweepCrossingMinimizer>>doc:Layer Sweep Crossing Minimization]]. 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. |
| 78 |
78 |
|
| 79 |
79 |
== Phase 4: Node Placement == |
| 80 |
80 |
|