Skip to Content
Last modified by msp on 2023/07/11 10:33
From version 5.1
edited by cds
on 2012/08/09 15:47
Change comment: There is no comment for this version
To version 4.1
edited by cds
on 2012/08/09 15:47
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -10,4 +10,4 @@
10 10  * The IPortDistributor is used by the LayerSweepCrossingMinimizer to handle the final port distribution as well as the ICrossingMinimizationHeuristic to calculate port ranks, which are needed to determine node barycenters. The standard implementation is the NodeRelativePortDistributor.
11 11  * If a heuristic doesn't know how to handle constraints, it can make use of an IConstraintResolver to resolve any constraints after it has determined an initial node ordering. The standard implementation is the ForsterConstraintResolver, which implements a constraint resolving heuristic proposed by Michael Forster.
12 12  
13 -[[attach:class_diagram.png]][[attach:class_diagram.png]]NodeGroups are used by the CompoundGraphLayerCrossingMinimizer to encapsulate sets of nodes contained in a single compound node, to treat them as an atomic group with fixed ordering.
13 +[[attach:class_diagram.png]]NodeGroups are used by the CompoundGraphLayerCrossingMinimizer to encapsulate sets of nodes contained in a single compound node, to treat them as an atomic group with fixed ordering.
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -2490441
1 +2490440
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/2490441/Layer Sweep Crossing Minimization
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/2490440/Layer Sweep Crossing Minimization