de.cau.cs.kieler.klodd.hierarchical.impl
Class BarycenterCrossingReducer
java.lang.Object
de.cau.cs.kieler.core.alg.AbstractAlgorithm
de.cau.cs.kieler.klodd.hierarchical.impl.BarycenterCrossingReducer
- All Implemented Interfaces:
- IAlgorithm, ISingleLayerCrossingReducer
public class BarycenterCrossingReducer
- extends AbstractAlgorithm
- implements ISingleLayerCrossingReducer
Implementation of the barycenter method for the 2-layer crossing reduction
problem.
- Rating

- (2009-12-11) msp
Method Summary |
void |
reduceCrossings(Layer layer)
Reduce crossings by changing the order of nodes in the given layer. |
void |
reduceCrossings(Layer layer,
boolean forward)
Reduce crossings by changing the order of nodes in the given layer. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
BarycenterCrossingReducer
public BarycenterCrossingReducer()
reduceCrossings
public void reduceCrossings(Layer layer,
boolean forward)
- Reduce crossings by changing the order of nodes in the given layer. Only
one other layer is considered for crossings reduction.
- Specified by:
reduceCrossings
in interface ISingleLayerCrossingReducer
- Parameters:
layer
- layer to be orderedforward
- if true, connections go to the given layer, else from the
given layer
reduceCrossings
public void reduceCrossings(Layer layer)
- Reduce crossings by changing the order of nodes in the given layer. Both
the preceding and the succeeding layers are considered for crossings
reduction.
- Specified by:
reduceCrossings
in interface ISingleLayerCrossingReducer
- Parameters:
layer
- layer to be ordered