de.cau.cs.kieler.klodd.hierarchical.impl
Class LongestPathLayerAssigner
java.lang.Object
de.cau.cs.kieler.core.alg.AbstractAlgorithm
de.cau.cs.kieler.klodd.hierarchical.impl.LongestPathLayerAssigner
- All Implemented Interfaces:
- IAlgorithm, ILayerAssigner
public class LongestPathLayerAssigner
- extends AbstractAlgorithm
- implements ILayerAssigner
Layer assigner working with the longest path layering algorithm.
- Rating

- (2009-12-11) msp
Method Summary |
LayeredGraph |
assignLayers(KSlimGraph slimGraph,
KNode parentNode,
float objSpacing,
boolean balanceOverSize)
Create a layered graph and assign layers to each node. |
void |
reset()
Removes the associated progress monitor. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
LongestPathLayerAssigner
public LongestPathLayerAssigner()
reset
public void reset()
- Removes the associated progress monitor. Any subclass that overrides this
method should call
super.reset()
.
- Specified by:
reset
in interface IAlgorithm
- Overrides:
reset
in class AbstractAlgorithm
assignLayers
public LayeredGraph assignLayers(KSlimGraph slimGraph,
KNode parentNode,
float objSpacing,
boolean balanceOverSize)
- Create a layered graph and assign layers to each node. The input ports
must be put into the first layer (rank == 0), the output ports into the
last layer (height == 0).
- Specified by:
assignLayers
in interface ILayerAssigner
- Parameters:
slimGraph
- graph structure that contains no directed cyclesparentNode
- the parent layout nodeobjSpacing
- the minimal distance between objectsbalanceOverSize
- indicates whether node balancing has priority over
diagram size
- Returns:
- a layered graph