de.cau.cs.kieler.klodd.hierarchical.impl
Class LayerSweepCrossingReducer
java.lang.Object
de.cau.cs.kieler.core.alg.AbstractAlgorithm
de.cau.cs.kieler.klodd.hierarchical.impl.LayerSweepCrossingReducer
- All Implemented Interfaces:
- IAlgorithm, ICrossingReducer
public class LayerSweepCrossingReducer
- extends AbstractAlgorithm
- implements ICrossingReducer
Implementation of a crossing reducer that performs a layer-by-layer sweep
with a 2-layer crossing reducer.
- Rating

- (2009-12-11) msp
Method Summary |
void |
reduceCrossings(LayeredGraph layeredGraph)
Reduces the number of crossings in a given layered directed graph by
changing the order of nodes in each layer. |
void |
setPasses(int thepasses)
Sets the number of passes for crossing reduction. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
LayerSweepCrossingReducer
public LayerSweepCrossingReducer(ISingleLayerCrossingReducer thelayerReducer)
- Creates a layer-by-layer sweep crossing reducer with given single layer
crossing reducer.
- Parameters:
thelayerReducer
- the single layer crossing reducer
setPasses
public void setPasses(int thepasses)
- Sets the number of passes for crossing reduction.
- Parameters:
thepasses
- number of passes
reduceCrossings
public void reduceCrossings(LayeredGraph layeredGraph)
- Reduces the number of crossings in a given layered directed graph by
changing the order of nodes in each layer.
- Specified by:
reduceCrossings
in interface ICrossingReducer
- Parameters:
layeredGraph
- layered graph to process