Uses of Class
de.cau.cs.kieler.klodd.hierarchical.structures.LayeredGraph

Packages that use LayeredGraph
de.cau.cs.kieler.klodd.hierarchical.impl Implementation of the hierarchical dataflow layout algorithm. 
de.cau.cs.kieler.klodd.hierarchical.modules Definition of the different modules used by the hierarchical dataflow layout algorithm. 
de.cau.cs.kieler.klodd.hierarchical.structures The layered graph data structure used internally by the hierarchical dataflow layout algorithm. 
 

Uses of LayeredGraph in de.cau.cs.kieler.klodd.hierarchical.impl
 

Methods in de.cau.cs.kieler.klodd.hierarchical.impl that return LayeredGraph
 LayeredGraph BalancingLayerAssigner.assignLayers(KSlimGraph graph, KNode parentNode, float objSpacing, boolean balanceOverSize)
          Create a layered graph and assign layers to each node.
 LayeredGraph LongestPathLayerAssigner.assignLayers(KSlimGraph slimGraph, KNode parentNode, float objSpacing, boolean balanceOverSize)
          Create a layered graph and assign layers to each node.
 

Methods in de.cau.cs.kieler.klodd.hierarchical.impl with parameters of type LayeredGraph
 void SortingNodewiseEdgePlacer.placeEdges(LayeredGraph layeredGraph)
          Determine placement for all edges starting or ending at regular nodes of the given layered graph.
 void BalancingNodePlacer.placeNodes(LayeredGraph layeredGraph, float theobjSpacing, float borderSpacing, boolean thebalanceOverSize)
          Determine a placement for each node in the given layered graph.
 void BasicNodePlacer.placeNodes(LayeredGraph layeredGraph, float theobjSpacing, float theborderSpacing, boolean balanceOverSize)
          Determine a placement for each node in the given layered graph.
 void InteractiveCrossingReducer.reduceCrossings(LayeredGraph layeredGraph)
          Reduces the number of crossings in a given layered directed graph by changing the order of nodes in each layer.
 void LayerSweepCrossingReducer.reduceCrossings(LayeredGraph layeredGraph)
          Reduces the number of crossings in a given layered directed graph by changing the order of nodes in each layer.
 void RectilinearEdgeRouter.routeEdges(LayeredGraph layeredGraph, float theobjSpacing, float theborderSpacing)
          Route the edges of the given layered graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klodd.hierarchical.modules
 

Methods in de.cau.cs.kieler.klodd.hierarchical.modules that return LayeredGraph
 LayeredGraph ILayerAssigner.assignLayers(KSlimGraph slimGraph, KNode parentNode, float objSpacing, boolean balanceOverSize)
          Create a layered graph and assign layers to each node.
 

Methods in de.cau.cs.kieler.klodd.hierarchical.modules with parameters of type LayeredGraph
 void INodewiseEdgePlacer.placeEdges(LayeredGraph layeredGraph)
          Determine placement for all edges starting or ending at regular nodes of the given layered graph.
 void INodePlacer.placeNodes(LayeredGraph layeredGraph, float objSpacing, float borderSpacing, boolean balanceOverSize)
          Determine a placement for each node in the given layered graph.
 void ICrossingReducer.reduceCrossings(LayeredGraph layeredGraph)
          Reduces the number of crossings in a given layered directed graph by changing the order of nodes in each layer.
 void IEdgeRouter.routeEdges(LayeredGraph layeredGraph, float objSpacing, float borderSpacing)
          Route the edges of the given layered graph.
 

Uses of LayeredGraph in de.cau.cs.kieler.klodd.hierarchical.structures
 

Methods in de.cau.cs.kieler.klodd.hierarchical.structures that return LayeredGraph
 LayeredGraph Layer.getLayeredGraph()
          Gets the layered graph.
 

Constructors in de.cau.cs.kieler.klodd.hierarchical.structures with parameters of type LayeredGraph
Layer(int therank, int theheight, LayeredGraph thelayeredGraph)
          Creates a new layer with given rank and height.