Package de.cau.cs.kieler.klodd.hierarchical.impl

Implementation of the hierarchical dataflow layout algorithm.

See:
          Description

Class Summary
BalancingLayerAssigner Layer assigner that balances the output of a basic layer assigner.
BalancingNodePlacer Node placing algorithm that improves the overall balance of the graph after executing a basic node placer.
BarycenterCrossingReducer Implementation of the barycenter method for the 2-layer crossing reduction problem.
BasicNodePlacer Node placing algorithm that orders all linear segments and creates an unbalanced placement.
InteractiveCrossingReducer  
LayerSweepCrossingReducer Implementation of a crossing reducer that performs a layer-by-layer sweep with a 2-layer crossing reducer.
LongestPathLayerAssigner Layer assigner working with the longest path layering algorithm.
RectilinearEdgeRouter Edge routing algorithm that makes rectilinear edges.
SortingLayerwiseEdgePlacer Layerwise edge placer implementation that sorts the edges and gives them slot ranks according to the result.
SortingNodewiseEdgePlacer Nodewise edge placer implementation that sorts the edges and gives them slot ranks according to the result.
ToponumLayerwiseEdgePlacer Layerwise edge placer implementation that orders routing slots using topological numbering.
 

Package de.cau.cs.kieler.klodd.hierarchical.impl Description

Implementation of the hierarchical dataflow layout algorithm.