Package de.cau.cs.kieler.core.slimgraph.alg

Algorithms for the slim graph data structure.

See:
          Description

Interface Summary
ICycleRemover Interface for algorithms for removal of cycles in a layout graph.
IPlanarityTester Interface for algorithms that test planarity of a biconnected graph.
 

Class Summary
AbstractCycleRemover Abstract superclass that can be used for implementations of cycle remover algorithms which operate by reversing edges.
DFSCycleRemover Cycle remover that uses a depth first search to remove cycles.
GreedyCycleRemover Cycle remover implementation that uses a greedy algorithm.
HopcroftTarjanPlanarityTester Implementation of the Hopcroft & Tarjan planarity test.
InteractiveCycleRemover A cycle remover that allows interactive layout by considering the node positions given by the user.
 

Package de.cau.cs.kieler.core.slimgraph.alg Description

Algorithms for the slim graph data structure. These are general graph algorithms that are used in various contexts.