Uses of Class
de.cau.cs.kieler.klay.layered.graph.LayeredGraph

Packages that use LayeredGraph
de.cau.cs.kieler.klay.layered Base package of the layered layouter. 
de.cau.cs.kieler.klay.layered.graph Basic structures for the layered layouter. 
de.cau.cs.kieler.klay.layered.intermediate Intermediate layout processors. 
de.cau.cs.kieler.klay.layered.p1cycles Phase 1 - cycle breaking by edge reversal. 
de.cau.cs.kieler.klay.layered.p2layers Phase 2 - layer assignment. 
de.cau.cs.kieler.klay.layered.p3order Phase 3 - crossing minimization by node reordering. 
de.cau.cs.kieler.klay.layered.p4nodes Phase 4 - vertical node placement. 
de.cau.cs.kieler.klay.layered.p5edges Phase 5 - edge routing and horizontal node placement. 
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered
 

Methods in de.cau.cs.kieler.klay.layered that return LayeredGraph
 LayeredGraph CompoundKGraphImporter.importGraph(KNode kgraph)
          Create a layered graph from the given graph.
 LayeredGraph KGraphImporter.importGraph(KNode kgraph)
          Create a layered graph from the given graph.
 LayeredGraph IGraphImporter.importGraph(T graph)
          Create a layered graph from the given graph.
 LayeredGraph ComponentsProcessor.pack(List<LayeredGraph> components)
          Pack the given components into a single graph.
 

Methods in de.cau.cs.kieler.klay.layered that return types with arguments of type LayeredGraph
 List<LayeredGraph> ComponentsProcessor.split(LayeredGraph graph)
          Split the given graph into its connected components.
 

Methods in de.cau.cs.kieler.klay.layered with parameters of type LayeredGraph
 void CompoundKGraphImporter.applyLayout(LayeredGraph layeredGraph)
          Apply the computed layout of the given layered graph to the original input graph.
 void IGraphImporter.applyLayout(LayeredGraph layeredGraph)
          Apply the computed layout of the given layered graph to the original input graph.
 void KGraphImporter.applyLayout(LayeredGraph layeredGraph)
          Apply the computed layout of the given layered graph to the original input graph.
static String Util.getDebugOutputFileBaseName(LayeredGraph graph)
          Returns the beginning of the file name used for debug output graphs while layouting the given layered graph.
protected  KVector AbstractGraphImporter.getExternalPortPosition(LayeredGraph graph, LNode portDummy, double portWidth, double portHeight)
          Calculates the position of the external port's top left corner from the position of the given dummy node that represents the port.
 IntermediateProcessingStrategy ILayoutPhase.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
static LNode Util.getRelatedCompoundNode(LNode node, LayeredGraph layeredGraph)
          Get the compound node an LNode belongs to.
 void LayeredLayoutProvider.layout(LayeredGraph graph, IKielerProgressMonitor themonitor)
          Perform the five phases of the layered layouter.
 void ILayoutProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 List<LayeredGraph> ComponentsProcessor.split(LayeredGraph graph)
          Split the given graph into its connected components.
 

Method parameters in de.cau.cs.kieler.klay.layered with type arguments of type LayeredGraph
 LayeredGraph ComponentsProcessor.pack(List<LayeredGraph> components)
          Pack the given components into a single graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered.graph
 

Methods in de.cau.cs.kieler.klay.layered.graph that return LayeredGraph
 LayeredGraph Layer.getGraph()
          Returns the layered graph that owns this layer.
 

Methods in de.cau.cs.kieler.klay.layered.graph with parameters of type LayeredGraph
 KVector LNode.getAnchorPointPosition(LayeredGraph graph)
          Returns the position of this node's anchor point.
 

Constructors in de.cau.cs.kieler.klay.layered.graph with parameters of type LayeredGraph
Layer(LayeredGraph graph)
          Creates a layer for the given layered graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered.intermediate
 

Methods in de.cau.cs.kieler.klay.layered.intermediate with parameters of type LayeredGraph
 void BigNodesProcessor.process(LayeredGraph theLayeredGraph)
          Main method for the Big-Node-Handler.
 void CommentPostprocessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void CommentPreprocessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void CompoundCycleProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void CompoundDummyEdgeRemover.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void CompoundGraphRestorer.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void CompoundSideProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void EdgeAndLayerConstraintEdgeReverser.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void GraphTransformer.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void HierarchicalPortConstraintProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void HierarchicalPortDummySizeProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void HierarchicalPortOrthogonalEdgeRouter.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void HierarchicalPortPositionProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void HyperedgeDummyMerger.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void HypernodesProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void InLayerConstraintProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void InvertedPortProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void LayerConstraintProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void LongEdgeJoiner.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void LongEdgeSplitter.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void NodeMarginCalculator.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void NorthSouthPortPostprocessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void NorthSouthPortPreprocessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void PortListSorter.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void PortPositionProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void PortSideProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void ReversedEdgeRestorer.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void SelfLoopProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void SubgraphOrderingProcessor.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered.p1cycles
 

Methods in de.cau.cs.kieler.klay.layered.p1cycles with parameters of type LayeredGraph
 IntermediateProcessingStrategy GreedyCycleBreaker.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 IntermediateProcessingStrategy InteractiveCycleBreaker.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 void GreedyCycleBreaker.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void InteractiveCycleBreaker.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered.p2layers
 

Methods in de.cau.cs.kieler.klay.layered.p2layers with parameters of type LayeredGraph
 IntermediateProcessingStrategy InteractiveLayerer.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 IntermediateProcessingStrategy LongestPathLayerer.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 IntermediateProcessingStrategy NetworkSimplexLayerer.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 void InteractiveLayerer.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void LongestPathLayerer.process(LayeredGraph thelayeredGraph)
          Performs the phase's work on the given graph.
 void NetworkSimplexLayerer.process(LayeredGraph theLayeredGraph)
          The main method of the network simplex layerer.
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered.p3order
 

Methods in de.cau.cs.kieler.klay.layered.p3order with parameters of type LayeredGraph
protected  int CompoundGraphLayerCrossingMinimizer.compoundMinimizeCrossings(LNode[] layer, int layerIndex, boolean forward, boolean preOrdered, boolean randomize, LayeredGraph layeredGraph)
          Uses an ICrossingMinimizationHeuristic to compute a node order for a given layer.
 IntermediateProcessingStrategy AbstractCrossingMinimizer.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 void InteractiveCrossingMinimizer.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void LayerSweepCrossingMinimizer.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered.p4nodes
 

Methods in de.cau.cs.kieler.klay.layered.p4nodes with parameters of type LayeredGraph
 IntermediateProcessingStrategy LinearSegmentsNodePlacer.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 void LinearSegmentsNodePlacer.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klay.layered.p5edges
 

Methods in de.cau.cs.kieler.klay.layered.p5edges with parameters of type LayeredGraph
 IntermediateProcessingStrategy OrthogonalEdgeRouter.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 IntermediateProcessingStrategy PolylineEdgeRouter.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 IntermediateProcessingStrategy SplineEdgeRouter.getIntermediateProcessingStrategy(LayeredGraph graph)
          Returns the intermediate layout processors this phase depends on.
 void SimpleLabelPlacer.placeLabels(LayeredGraph thelayeredGraph)
          Calculates label positions for given graph and stores them in it.
 void OrthogonalEdgeRouter.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void PolylineEdgeRouter.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 void SplineEdgeRouter.process(LayeredGraph layeredGraph)
          Performs the phase's work on the given graph.
 int OrthogonalRoutingGenerator.routeEdges(LayeredGraph layeredGraph, Iterable<LNode> sourceLayerNodes, int sourceLayerIndex, Iterable<LNode> targetLayerNodes, double startPos)
          Route edges between the given layers.