Uses of Interface
de.cau.cs.kieler.core.alg.IAlgorithm

Packages that use IAlgorithm
de.cau.cs.kieler.core.alg Basic API for algorithms and their implementations following the strategy design pattern. 
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. 
de.cau.cs.kieler.klodd.hierarchical.modules Definition of the different modules used by the hierarchical dataflow layout algorithm. 
 

Uses of IAlgorithm in de.cau.cs.kieler.core.alg
 

Classes in de.cau.cs.kieler.core.alg that implement IAlgorithm
 class AbstractAlgorithm
          Superclass for algorithms used in the KIELER project.
 

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

Subinterfaces of IAlgorithm in de.cau.cs.kieler.core.slimgraph.alg
 interface ICycleRemover
          Interface for algorithms for removal of cycles in a layout graph.
 interface IPlanarityTester
          Interface for algorithms that test planarity of a biconnected graph.
 

Classes in de.cau.cs.kieler.core.slimgraph.alg that implement IAlgorithm
 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.
 

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

Classes in de.cau.cs.kieler.kiml.layout.util that implement IAlgorithm
 class GraphConverter
          Class that converts a KGraph into a slim graph.
 

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

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

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

Classes in de.cau.cs.kieler.klodd.hierarchical.impl that implement IAlgorithm
 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 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.
 

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

Subinterfaces of IAlgorithm in de.cau.cs.kieler.klodd.hierarchical.modules
 interface ICrossingReducer
          Interface for algorithms that reduce crossings in a layered graph.
 interface IEdgeRouter
          Interface for algorithms that route edges in a layered graph.
 interface ILayerAssigner
          Interface for algorithms that assign layers to each node of a graph.
 interface ILayerwiseEdgePlacer
          Interface for algorithms that calculate routing slots for connections going from a layer to the subsequent one.
 interface INodePlacer
          Interface for algorithms that determine a placement for each node in a layered graph.
 interface INodewiseEdgePlacer
          Interface for algorithms that calculate routing slots for connections starting and ending at regular nodes.
 interface ISingleLayerCrossingReducer
          Interface for algorithms that offer heuristics for the 2-layer and 3-layer crossing reduction problem.