de.cau.cs.kieler.klay.layered.p3order
Class InteractiveCrossingMinimizer
java.lang.Object
de.cau.cs.kieler.core.alg.AbstractAlgorithm
de.cau.cs.kieler.klay.layered.p3order.AbstractCrossingMinimizer
de.cau.cs.kieler.klay.layered.p3order.InteractiveCrossingMinimizer
- All Implemented Interfaces:
- IAlgorithm, ILayoutPhase, ILayoutProcessor
public class InteractiveCrossingMinimizer
- extends AbstractCrossingMinimizer
A crossing minimizer that allows user interaction by respecting previous node positions.
- Precondition:
- The graph has a proper layering, i.e. all
long edges have been splitted; all nodes have at least fixed port
sides.
- Postcondition:
- The order of nodes in each layer is rearranged
according to previous positions given by the input graph.
- 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 |
InteractiveCrossingMinimizer
public InteractiveCrossingMinimizer()
process
public void process(LayeredGraph layeredGraph)
- Performs the phase's work on the given graph.
- Parameters:
layeredGraph
- a layered graph