Uses of Class
de.cau.cs.kieler.core.alg.AbstractAlgorithm

Packages that use AbstractAlgorithm
de.cau.cs.kieler.core.slimgraph.alg Algorithms for the slim graph data structure. 
de.cau.cs.kieler.kiml.layout.util Utility classes for automatic layout using KIML. 
de.cau.cs.kieler.kiml.layout.util.alg Algorithms for the KIML utility classes. 
de.cau.cs.kieler.klodd.hierarchical.impl Implementation of the hierarchical dataflow layout algorithm. 
 

Uses of AbstractAlgorithm in de.cau.cs.kieler.core.slimgraph.alg
 

Subclasses of AbstractAlgorithm in de.cau.cs.kieler.core.slimgraph.alg
 class AbstractCycleRemover
          Abstract superclass that can be used for implementations of cycle remover algorithms which operate by reversing edges.
 class DFSCycleRemover
          Cycle remover that uses a depth first search to remove cycles.
 class GreedyCycleRemover
          Cycle remover implementation that uses a greedy algorithm.
 class HopcroftTarjanPlanarityTester
          Implementation of the Hopcroft & Tarjan planarity test.
 class InteractiveCycleRemover
          A cycle remover that allows interactive layout by considering the node positions given by the user.
 

Uses of AbstractAlgorithm in de.cau.cs.kieler.kiml.layout.util
 

Subclasses of AbstractAlgorithm in de.cau.cs.kieler.kiml.layout.util
 class GraphConverter
          Class that converts a KGraph into a slim graph.
 

Uses of AbstractAlgorithm in de.cau.cs.kieler.kiml.layout.util.alg
 

Subclasses of AbstractAlgorithm in de.cau.cs.kieler.kiml.layout.util.alg
 class BoxPlacer
          Placing algorithm for boxes.
 class BoxSorter
          Algorithm that sorts nodes according to their priority and size.
 

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

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