de.cau.cs.kieler.klay.layered.p2layers
Class LongestPathLayerer
java.lang.Object
de.cau.cs.kieler.core.alg.AbstractAlgorithm
de.cau.cs.kieler.klay.layered.p2layers.LongestPathLayerer
- All Implemented Interfaces:
- IAlgorithm, ILayoutPhase, ILayoutProcessor
public class LongestPathLayerer
- extends AbstractAlgorithm
- implements ILayoutPhase
The most basic layering algorithm, which assign layers according to the
longest path to a sink.
- Precondition:
- the graph has no cycles
- Postcondition:
- all nodes have been assigned a layer such that
edges connect only nodes from layers with increasing indices
- Rating

Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
LongestPathLayerer
public LongestPathLayerer()
getIntermediateProcessingStrategy
public IntermediateProcessingStrategy getIntermediateProcessingStrategy(LayeredGraph graph)
- Returns the intermediate layout processors this phase depends on.
- Specified by:
getIntermediateProcessingStrategy
in interface ILayoutPhase
- Parameters:
graph
- the layered graph to be processed. The strategy may vary
depending on certain properties of the graph.
- Returns:
- intermediate processing strategy. May be
null
.
process
public void process(LayeredGraph thelayeredGraph)
- Performs the phase's work on the given graph.
- Specified by:
process
in interface ILayoutProcessor
- Parameters:
thelayeredGraph
- a layered graph