de.cau.cs.kieler.klay.layered.intermediate
Class LongEdgeJoiner
java.lang.Object
de.cau.cs.kieler.core.alg.AbstractAlgorithm
de.cau.cs.kieler.klay.layered.intermediate.LongEdgeJoiner
- All Implemented Interfaces:
- IAlgorithm, ILayoutProcessor
public class LongEdgeJoiner
- extends AbstractAlgorithm
- implements ILayoutProcessor
Removes dummy nodes due to edge splitting. (dummy nodes that have the node
type NodeType.LONG_EDGE
)
- Precondition:
- a layered graph; nodes are placed; edges are routed.
- Postcondition:
- there are no dummy nodes of type
NodeType.LONG_EDGE
.
- Slots:
- After phase 5.
- Same-slot dependencies:
HierarchicalPortOrthogonalEdgeRouter
- Rating

Method Summary |
void |
process(LayeredGraph layeredGraph)
Performs the phase's work on the given graph. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
LongEdgeJoiner
public LongEdgeJoiner()
process
public void process(LayeredGraph layeredGraph)
- Performs the phase's work on the given graph.
- Specified by:
process
in interface ILayoutProcessor
- Parameters:
layeredGraph
- a layered graph