de.cau.cs.kieler.klay.layered.intermediate
Class EdgeAndLayerConstraintEdgeReverser
java.lang.Object
de.cau.cs.kieler.core.alg.AbstractAlgorithm
de.cau.cs.kieler.klay.layered.intermediate.EdgeAndLayerConstraintEdgeReverser
- All Implemented Interfaces:
- IAlgorithm, ILayoutProcessor
public class EdgeAndLayerConstraintEdgeReverser
- extends AbstractAlgorithm
- implements ILayoutProcessor
Makes sure nodes with edge or layer constraints have only incoming or only outgoing edges,
as appropriate. This is done even before cycle breaking because the result may
already break some cycles. This processor is required for
LayerConstraintProcessor
to work correctly. If edge constraints are in conflict
with layer constraints, the latter take precedence.
- Precondition:
- an unlayered graph.
- Postcondition:
- nodes with layer constraints have only incoming or
only outgoing edges, as appropriate.
- Slots:
- Before phase 1.
- Same-slot dependencies:
- None.
- See Also:
LayerConstraintProcessor
- 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 |
EdgeAndLayerConstraintEdgeReverser
public EdgeAndLayerConstraintEdgeReverser()
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