 ogdf | |
  augmentation | |
   DfsMakeBiconnected.h | Provides a simple, dfs-based algorithm for biconnectivity augmentation |
   PlanarAugmentation.h | Planar biconnected augmentation approximation algorithm |
   PlanarAugmentationFix.h | Planar biconnected augmentation algorithm with fixed combinatorial embedding |
  basic | |
   AdjEntryArray.h | Declaration and implementation of AdjEntryArray class |
   Array.h | Declaration and implementation of Array class and Array algorithms |
   Array2D.h | Declaration and implementation of class Array2D which |
   ArrayBuffer.h | Declaration and implementation of ArrayBuffer class |
   Barrier.h | Implementation of a thread barrier |
   basic.h | Basic declarations, included by all source files |
   BinaryHeap.h | Implementation of binary heap class that allows the decreaseKey operation |
   BinaryHeap2.h | Implementation of binary heap class that allows the decreaseKey operation |
   BoundedQueue.h | Declaration and implementation of bounded queue class |
   BoundedStack.h | Declaration and implementation of bounded stack class |
   CombinatorialEmbedding.h | Declaration of CombinatorialEmbedding and face |
   comparer.h | Declarations for Comparer objects |
   Constraints.h | Declaration of base class for drawing constraints |
   CriticalSection.h | Implementation of criticial sections |
   DisjointSets.h | Implementation of disjoint sets data structures (union-find functionality) |
   DualGraph.h | Includes declaration of dual graph class |
   EdgeArray.h | Declaration and implementation of EdgeArray class |
   EdgeComparer.h | Declares EdgeComparer class |
   EdgeComparerSimple.h | Declares EdgeComparerSimple class |
   EFreeList.h | Declaration and implementation of a simple freelist and an index pool which generates unique indices for elements |
   EList.h | Declaration and implementation of embedded stack and list functionality which is useful for embedded chains of elements (classes with internal next and previous pointer) |
   exceptions.h | Definition of exception classes |
   extended_graph_alg.h | Declaration of extended graph algorithms |
   FaceArray.h | Declaration and implementation of FaceArray class |
   FaceSet.h | Declaration and implementation of class FaceSetSimple, FaceSetPure and FaceSet |
   geometry.h | Declaration of classes DPoint, DPolyline, DLine, DRect, DScaler |
   Graph.h | Includes declaration of graph class |
   Graph_d.h | Pure declaration header, find template implementation in Graph.h |
   graph_generators.h | Declaration of graph generators |
   GraphAttributes.h | Declaration of class GraphAttributes which extends a Graph by additional attributes |
   GraphCopy.h | Declaration of graph copy classes |
   GraphCopyAttributes.h | Declaration of class GraphCopy Attributes which manages access on a copy of an attributed graph |
   GraphObserver.h | Abstract base class for structures on graphs, that need to be informed about graph changes (e.g. cluster graphs) |
   GridLayout.h | Declaration of class GridLayout |
   GridLayoutMapped.h | Declaration of class GridLayoutMapped which extends GridLayout by a grid mapping mechanism |
   HashArray.h | Declaration and implementation of HashArray class |
   HashArray2D.h | Declaration of class HashArray2D |
   Hashing.h | Declaration of classes used for hashing |
   HashIterator2D.h | Declaration of class HashIterator2D |
   HeapBase.h | Declaration of an abstract heap base class for priority queue implementation |
   HyperGraph.h | Declaration and implementation of a HyperGraph |
   IncNodeInserter.h | Declaration of class IncNodeInserter |
   Layout.h | Declaration of class Layout |
   List.h | Declaration of doubly linked lists and iterators |
   Logger.h | Contains logging functionality |
   Math.h | Mathematical Helpers |
   memory.h | Declaration of memory manager for allocating small pieces of memory |
   MinHeap.h | Declares & Implements Binary Heap, and Top10Heap |
   MinPriorityQueue.h | Declaration of a base class for planar representations of graphs and cluster graphs |
   Module.h | Declares base class for all module types |
   ModuleOption.h | Declaration of parameterized class for module options |
   NearestRectangleFinder.h | Declaration of class NearestRectangleFinder |
   NodeArray.h | Declaration and implementation of NodeArray class |
   NodeComparer.h | The NodeComparer compares nodes on base of the value stored in a node array given as constructor parameter |
   NodeSet.h | Declaration and implementation of class NodeSetSimple, NodeSetPure and NodeSet |
   precondition.h | Declaration of functions for drawing module precondition handling |
   PreprocessorLayout.h | Preprocessor Layout simplifies Graphs for use in other Algorithms |
   Queue.h | Declaration and implementation of list-based queues (classes QueuePure<E> and Queue<E>) |
   simple_graph_alg.h | Declaration of simple graph algorithms |
   Skiplist.h | Declaration of class Skiplist |
   SList.h | Declaration and implementation of singly linked lists (SListPure<E> and SList<E>) and iterators (SListConstIterator<E> and SListIterator<E>) |
   Stack.h | Declaration and implementation of list-based stacks (StackPure<E> and Stack<E>) |
   String.h | Declaration of class String |
   System.h | Decalration of System class which provides unified access to system information |
   Thread.h | Implementation of mutexes |
   Timeouter.h | Declares base class for modules with timeout functionality |
   TopologyModule.h | Declaration of class TopologyModule |
   tuples.h | Declaration and implementation of class Tuple2, Tuple3 and Tuple4 |
   UMLGraph.h | Declaration of class UMLGraph |
  cluster | |
   CconnectClusterPlanar.h | Cluster Planarity tests and Cluster Planar embedding for C-connected Cluster Graphs |
   CconnectClusterPlanarEmbed.h | Cluster planarity tests and cluster planar embedding for c-connected clustered graphs. Based on the algorithm by Cohen, Feng and Eades which uses PQ-trees |
   ClusterArray.h | Declaration and implementation of ClusterArray class |
   ClusterGraph.h | Derived class of GraphObserver providing additional functionality to handle clustered graphs |
   ClusterGraphAttributes.h | Declares ClusterGraphAttributes, an extension of class GraphAttributes, to store clustergraph layout informations like cluster cage positions and sizes that can be accessed over the cluster/cluster ID |
   ClusterGraphCopyAttributes.h | Declares ClusterGraphCopyAttributes, which manages access on copy of an attributed clustered graph |
   ClusterGraphObserver.h | Abstract base class for structures on graphs, that need to be informed about cluster graph changes |
   ClusterOrthoLayout.h | Declares ClusterOrthoLayout which represents an orthogonal planar drawing algorithm for c-planar c-connected Clustergraphs |
   ClusterOrthoShaper.h | Computes the Orthogonal Representation of a Planar Representation of a UML Graph using the simple flow approach |
   ClusterPlanarizationLayout.h | Declaration of class ClusterPlanarizationLayout Planarization approach for cluster graphs |
   ClusterPlanRep.h | Declaration of ClusterPlanRep class, allowing cluster boundary insertion and shortest path edge insertion |
   ClusterSet.h | Declaration and implementation of class ClusterSetSimple, ClusterSetPure and ClusterSet |
   CPlanarEdgeInserter.h | Declares CPlanarEdgeInserter class |
   CPlanarSubClusteredGraph.h | Declaration of CPlanarSubClusteredGraph class |
   MaximumCPlanarSubgraph.h | Declaration of an exact c-planar subgraph algorithm, i.e., a maximum c-planar subgraph is computed using a branch and cut approach |
  decomposition | |
   BCTree.h | Declaration of class BCTree |
   DynamicBCTree.h | Declaration of class DynamicBCTree |
   DynamicPlanarSPQRTree.h | Declaration of class DynamicPlanarSPQRTree |
   DynamicSkeleton.h | Declaration of class DynamicSkeleton |
   DynamicSPQRForest.h | Declaration of class DynamicSPQRForest |
   DynamicSPQRTree.h | Declaration of class DynamicSPQRTree |
   PertinentGraph.h | Declaration of class PertinentGraph |
   PlanarSPQRTree.h | Declaration of class PlanarSPQRTree |
   Skeleton.h | Declaration of class Skeleton |
   SPQRTree.h | Declaration of class SPQRTree |
   StaticPlanarSPQRTree.h | Declaration of class StaticPlanarSPQRTree |
   StaticSkeleton.h | Declaration of class StaticSkeleton |
   StaticSPQRTree.h | Declaration of class StaticSPQRTree |
  energybased | |
   multilevelmixer | |
    BarycenterPlacer.h | Places nodes at the barycenter of his neighbors |
    CirclePlacer.h | Places nodes on a circle around the barycenter of its neighbors |
    EdgeCoverMerger.h | Merges nodes with neighbour to get a Multilevel Graph |
    IndependentSetMerger.h | Merges nodes with neighbour to get a Multilevel Graph |
    InitialPlacer.h | Abstract InitialPlacer places the nodes of the level into the next |
    LocalBiconnectedMerger.h | Merges nodes with neighbour to get a Multilevel Graph |
    MatchingMerger.h | Merges nodes with neighbour to get a Multilevel Graph |
    MedianPlacer.h | Places nodes at the position of the merge-partner |
    MixedForceLayout.h | Uses Fruchtermann Rheingold and Fast Multipole Embedder for faster and better FR results |
    MMMExampleFastLayout.h | Useable example of the Modular Multilevel Mixer |
    MMMExampleNiceLayout.h | Useable example of the Modular Multilevel Mixer |
    MMMExampleNoTwistLayout.h | Useable example of the Modular Multilevel Mixer |
    ModularMultilevelMixer.h | MMM is a Multilevel Graph drawing Algorithm that can use different modules |
    MultilevelBuilder.h | Abstract MultilevelBuilder builds all Levels |
    RandomMerger.h | Merges nodes with neighbour to get a Multilevel Graph |
    RandomPlacer.h | Places nodes at the position of the merge-partner |
    ScalingLayout.h | ScalingLayout scales and calls a secondary layout |
    SolarMerger.h | Merges nodes with solar system rules |
    SolarPlacer.h | Places Nodes with solar system rules |
    ZeroPlacer.h | Places nodes at the position of the merge-partner |
   CoinTutteLayout.h | Declaration of Tutte's algorithm |
   DavidsonHarel.h | Declares class DavidsonHarel which implements the Davidson-Harel approach for drawing graphs |
   DavidsonHarelLayout.h | Declares class DavidsonHarelLayout, which is a front-end for the fDavidsonHarel class |
   FastMultipoleEmbedder.h | Declaration of Fast-Multipole-Embedder layout algorithm |
   FMMMLayout.h | Declaration of Fast Multipole Multilevel Method (FM^3) |
   GEMLayout.h | Declaration of class GEMLayout |
   MultilevelLayout.h | Declaration of class MultilevelLayout which realizes a wrapper for the multilevel layout computation using the Modular Multilevel Mixer |
   SpringEmbedderFR.h | Declaration of Spring-Embedder (Fruchterman,Reingold) algorithm |
   SpringEmbedderFRExact.h | Declaration of Spring-Embedder (Fruchterman,Reingold) algorithm with exact force computations |
   SpringEmbedderKK.h | Declaration of Spring-Embedder algorithm (Kamada,Kawai) |
   StressMajorizationSimple.h | Declaration of simple distance-based layout. Non-final Code (Status: purely experimental) |
  external | |
   abacus.h | Handles Abacus Dependencies |
   coin.h | Handles connection to the COIN library, by offering helper classes |
  fileformats | |
   DinoLineBuffer.h | Declaration of the clssses DinoLineBuffer and DinoLineBufferPosition |
   DinoTools.h | Declaration of the class DinoTools |
   DinoUmlDiagramGraph.h | Contains the class DinoUmlDiagramGraph which represents one particular diagram of the complete UML Model |
   DinoUmlModelGraph.h | Contains the class DinoUmlModelGraph which represents the complete UML Model in a graph like data structure |
   DinoUmlToGraphConverter.h | Contains the class DinoUmlToGraphConverter.. |
   DinoXmlParser.h | Contains the struct declarations XmlAttributeObject, XmlTagObject and the class DinoXmlParser |
   DinoXmlScanner.h | Contains the enum XmlToken and the class DinoXmlScanner |
   GmlParser.h | Declaration of classes GmlObject and GmlParser |
   Ogml.h | Contains diverse enumerations and string constants. See comments for further information |
   OgmlParser.h | Implementation of auxiliary classes OgmlAttributeValue, OgmlAttribute and OgmlTag |
   simple_graph_load.h | Declaration of simple graph loaders |
   SteinLibParser.h | Implementation of a parser for SteinLib instances |
   XmlObject.h | Declaration of class XmlObject |
   XmlParser.h | Declaration of class XmlParser |
  graphalg | |
   CliqueFinder.h | Declares CliqueFinder class. CliqueFinder searches for complete (dense) subgraphs |
   Clusterer.h | Declaration of Clusterer class that computes a clustering for a given graph based on the local neighborhood structure of each edge. Uses the criteria by Auber, Chiricota, Melancon for small-world graphs to compute clustering index and edge strength |
   ConvexHull.h | Declaration of doubly linked lists and iterators |
   Dijkstra.h | Implementation of Dijkstra's single source shortest path algorithm |
   GraphReduction.h | Declaration and implementation of GraphReduction class reduces by Leaves & Chains |
   MinCostFlowReinelt.h | Declaration of min-cost-flow algorithm (class MinCostFlowReinelt) |
   MinimumCut.h | Declares & implements a minimum-cut algorithm according to an approach of Stoer and Wagner 1997. However, no Priority Queues are used as suggested in the approach. Should be adapted to improve performance |
   PageRank.h | Declaration of basic page rank |
   ShortestPathWithBFM.h | Declaration of class ShortestPathWithBFM which computes shortest paths via Bellman-Ford-Moore |
  internal | |
   augmentation | |
    PALabel.h | Declares auxiliary structure of planar augmentation algorithms |
   basic | |
    intrinsics.h | Include of header files for SSE-intrinsics |
    list_templates.h | Implementation of algorithms as templates working with different list types |
    MallocMemoryAllocator.h | Declaration of memory manager for allocating small pieces of memory |
    PoolMemoryAllocator.h | Declaration of memory manager for allocating small pieces of memory |
   cluster | |
    basics.h | Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    Cluster_ChunkConnection.h | Implementation of initial cut-constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    Cluster_CutConstraint.h | Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    Cluster_EdgeVar.h | Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    Cluster_MaxPlanarEdges.h | Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    ClusterPQContainer.h | Declaration of ClusterPQContainer |
    CPlanarSubClusteredST.h | Declaration of CPlanarSubClusteredST class |
    KuratowskiConstraint.h | Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    MaxCPlanar_Master.h | Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    MaxCPlanar_MinimalClusterConnection.h | Declaration of an initial constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem |
    MaxCPlanar_Sub.h | Declaration of the sub-problem class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem Contains separation algorithms as well as primal heuristics |
   energybased | |
    AdjacencyOracle.h | Declares class AdjacencyOracle |
    Attraction.h | Declares class Attraction |
    EdgeAttributes.h | Declaration of class EdgeAttributes |
    EnergyFunction.h | Declares class EnergyFunction.. |
    FruchtermanReingold.h | Declaration of class FruchtermanReingold (computation of forces) |
    IntersectionRectangle.h | Declaration of class IntersectionRectangle which realizes axis parallel rectangles |
    MultilevelGraph.h | MLG is the main data structure for ModularMultilevelMixer |
    NMM.h | Declaration of class NMM (New Multipole Method) |
    NodeAttributes.h | Declaration of class NodeAttributes |
    NodePairEnergy.h | Declares class NodePairEnergy which implements an energy function where the energy of a layout depends on the each pair of nodes |
    Overlap.h | Declaration of class Overlap which implements an energy function that gives a penalty for each pair of overlapping vertices |
    ParticleInfo.h | Declaration of class ParticleInfo |
    Planarity.h | Declaration of class Planarity which implements an energy function where the energy of a layout depends on the number of crossings |
    PlanarityGrid.h | Declaration of class PlanarityGrid which implements an energy function where the energy of a layout depends on the number of crossings |
    QuadTreeNM.h | Declaration of class QuadTreeNM |
    QuadTreeNodeNM.h | Declaration of class QuadTreeNodeNM |
    Repulsion.h | Declaration of class Repulsion which implements an enrgy function, where the energy of the layout grows with the proximity of the vertices |
    UniformGrid.h | Declaration of class UniformGrid |
   lpsolver | |
    LPSolver_coin.h | Coin implementation of class LPSolver |
   orthogonal | |
    NodeInfo.h | Declaration of class NodeInfo |
    RoutingChannel.h | Declaration of class RoutingChannel which maintains required size of routing channels and separation, cOverhang |
   planarity | |
    BoyerMyrvoldInit.h | Declaration of the classes BoyerMyrvoldInit and BucketLowPoint |
    BoyerMyrvoldPlanar.h | Declaration of the class BoyerMyrvoldPlanar |
    ConnectedSubgraph.h | Computes a connected subgraph G' of G containing node n |
    EmbedderMaxFaceBiconnectedGraphs.h | Computes an embedding of a biconnected graph with maximum external face |
    EmbedderMaxFaceBiconnectedGraphsLayers.h | Computes an embedding of a biconnected graph with maximum external face |
    EmbedIndicator.h | Declaration of the class EmbedIndicator |
    EmbedPQTree.h | Declaration of the class EmbedPQTree |
    FindKuratowskis.h | Declaration of the class FindKuratowskis |
    IndInfo.h | Declaration of the class EmbedKey |
    MaxSequencePQTree.h | Declaration and definition of the class MaxSequencePQTree |
    MDMFLengthAttribute.h | Length attribute used in EmbedderMinDepthMaxFace. It contains two components (d, l) and a linear order is defined by: (d, l) > (d', l') iff d > d' or (d = d' and l > l') |
    PlanarLeafKey.h | Declaration of class PlanarLeafKey |
    PlanarPQTree.h | Declaration of class PlanarPQTree |
    PlanarSubgraphPQTree.h | Declaration of class PlanarSubgraphPQTree |
    PQBasicKey.h | Declaration and implementation of the class PQBasicKey |
    PQBasicKeyRoot.h | Declaration and implementation of the class PQBasicKeyRoot |
    PQInternalKey.h | Declaration and implementation of the class PQInternalKey |
    PQInternalNode.h | Declaration and implementation of the class PQInternalNode |
    PQLeaf.h | Declaration and implementation of the class PQleaf |
    PQLeafKey.h | Declaration and implementation of the class PQLeafKey |
    PQNode.h | Declaration and implementation of the class PQNode |
    PQNodeKey.h | Declaration and implementation of the class PQNodeKey |
    PQNodeRoot.h | Declaration and implementation of the class PQNodeRoot |
    PQTree.h | Declaration and implementation of the class PQTree |
    whaInfo.h | Declaration of class whaInfo |
   steinertree | |
    EdgeWeightedGraph.h | Declaration of class WeightedGraph |
    EdgeWeightedGraphCopy.h | Extends the GraphCopy concept to weighted graphs |
  labeling | |
   EdgeLabel.h | Declaration of EdgeLabelPositioner classes used in EdgeLabel placement |
   ELabelInterface.h | Provide an interface for edge label information |
   ELabelPosSimple.h | Declaration of class ELabelPosSimple which represents a simple labeling algorithm |
  layered | |
   BarycenterHeuristic.h | Declaration of class BarycenterHeuristic |
   CoffmanGrahamRanking.h | Declaration of coffman graham ranking algorithm for Sugiyama algorithm |
   CrossingsMatrix.h | Declaration of class CrossingsMatrix |
   DfsAcyclicSubgraph.h | Declaration of class DfsAcyclicSubgraph |
   ExtendedNestingGraph.h | Declaration of ExtendedNestingGraph |
   FastHierarchyLayout.h | Declaration and implementation of the third phase of sugiyama |
   FastSimpleHierarchyLayout.h | Declaration of the FastSimpleHierarchyLayout (third phase of sugiyama) |
   GreedyCycleRemoval.h | Declaration of class GeedyCycleRemoval |
   GreedyInsertHeuristic.h | Declaration of class GreedyInsertHeuristic |
   GreedySwitchHeuristic.h | Declaration of class GreedySwitchHeuristic |
   Hierarchy.h | Declaration of Hierarchy class |
   Level.h | Declaration and implementation of Level class |
   LongestPathRanking.h | Declaration of hierachrical ranking algorithm |
   MedianHeuristic.h | Declaration of class MedianHeuristic |
   OptimalHierarchyClusterLayout.h | Declaration of the optimal third phase of the sugiyama algorithm for clusters |
   OptimalHierarchyLayout.h | Declaration and implementation of the optimal third phase of the Sugiyama algorithm |
   OptimalRanking.h | Declaration of optimal ranking algorithm for Sugiyama algorithm |
   SiftingHeuristic.h | Declaration of class SiftingHeuristic |
   SplitHeuristic.h | Declaration of class SplitHeuristic |
   SugiyamaLayout.h | Declaration of Sugiyama algorithm |
  lpsolver | |
   LPSolver.h | Declaration of class LPSolver which is the front-end for the LP solver |
  misclayout | |
   BalloonLayout.h | Declaration of class BalloonLayout. Computes a radial (balloon) layout based on a spanning tree. The algorithm is partially based on the paper "On Balloon Drawings of Rooted Trees" by Lin and Yen and on "Interacting with Huge Hierarchies: Beyond Cone Trees" by Carriere and Kazman |
   CircularLayout.h | Declares class CircularLayout |
   ProcrustesSubLayout.h | Declares class ProcrustesSubLayout |
  module | |
   AcyclicSubgraphModule.h | Declaration of interface for acyclic subgraph algorithms |
   AugmentationModule.h | Declaration of interface for graph augmentation algorithms |
   CCLayoutPackModule.h | Declaration of interface for algorithms that arrange/pack layouts of connected components |
   ClustererModule.h | Declaration of interface for clustering algorithms that compute a clustering for a given graph based on some structural or semantical properties |
   CPlanarSubgraphModule.h | Declaration of an interface for c-planar subgraph algorithms |
   CrossingMinimizationModule.h | Declaration of CrossingMinimization Module, an interface for crossing minimization algorithms |
   EdgeInsertionModule.h | Declaration of interface for edge insertion algorithms |
   EmbedderModule.h | Declaration of interface for embedder for graphs |
   ForceLayoutModule.h | Declaration of interface for energy-based layout algorithms (class ForceLayoutModule) |
   FUPSModule.h | Declaration of Feasible Upward Planar Subgraph (FUPS) Module, an interface for subgraph computation |
   GridLayoutModule.h | Declaration of interface for grid layout algorithms |
   HierarchyClusterLayoutModule.h | Declaration of interface for hierarchy layout algorithms (3. phase of Sugiyama) for cluster graphs |
   HierarchyLayoutModule.h | Declaration of interface hierarchy layout algorithms (3. phase of Sugiyama) |
   LayoutClusterPlanRepModule.h | Declaration of interface for planar layout algorithms for UML diagrams (used in planarization approach) |
   LayoutModule.h | Declaration of interface for layout algorithms (class LayoutModule) |
   LayoutPlanRepModule.h | Declaration of interface for planar layout algorithms for UML diagrams (used in planarization approach) |
   MinCostFlowModule.h | Declaration of base class of min-cost-flow algorithms |
   MixedModelCrossingsBeautifierModule.h | Declaration of interface for mixed-model crossings beautifier algorithms |
   MMCrossingMinimizationModule.h | Declaration of MMCrossingMinimization Module, an interface for minor-monotone crossing minimization algorithms |
   MMEdgeInsertionModule.h | Declaration of interface for minor-monotone edge insertion algorithms |
   MultilevelLayoutModule.h | Declaration of interface for layout algorithms that allow calls with a MultilevelGraph parameter (class MultilevelLayoutModule) |
   PlanarityModule.h | Module for planarity testing and planar embeddings |
   PlanarSubgraphModule.h | Declaration of interface for planar subgraph algorithms |
   RankingModule.h | Declaration of interface for ranking algorithms |
   ShellingOrderModule.h | Declares the base class ShellingOrderModule for modules that compute a shelling order of a graph |
   ShortestPathModule.h | Declaration of base class of shortest path algorithms including some useful functions dealing with shortest paths flow (generater, checker) |
   TwoLayerCrossMin.h | Declaration of interface for two-layer crossing minimization algorithms |
   UMLLayoutModule.h | Declaration of interface for layout algorithms for UML diagrams |
   UPRLayoutModule.h | Declaration of interface for layout algorithms for a UpwardPlanRep |
   UpwardEdgeInserterModule.h | Declaration of interface for edge insertion algorithms |
   UpwardPlanarizerModule.h | Declaration of UpwardPlanarizer Module, an interface for upward planarization algorithms |
   UpwardPlanarSubgraphModule.h | Declaration of interface for upward planar subgraph algorithms |
  orthogonal | |
   CompactionConstraintGraph.h | Declares CompactionConstraintGraph |
   EdgeRouter.h | Declaration of EdgeRouter.. |
   FlowCompaction.h | Constructive compaction applying computation of min-cost flow in the dual of the constraint graphs |
   LongestPathCompaction.h | Contains constructive and improvement compaction by applying computation of longest paths in constraint graphs |
   MinimumEdgeDistances.h | Declaration of class MinimumEdgeDistances which maintains minimum distances between attached edges at a vertex (delta's and epsilon's) |
   OrthoLayout.h | Declaration of class OrthoLayout which represents an orthogonal planar drawing algorithm for mixed-upward embedded graphs |
   OrthoRep.h | Declaration of orthogonal representation of planar graphs |
   OrthoShaper.h | Computes the orthogonal representation of a planar representation of a UML graph using the simple flow approach |
  packing | |
   ComponentSplitterLayout.h | Splits and packs the components of a Graph |
   TileToRowsCCPacker.h | Declaration of class TileToRowsCCPacker |
  planarity | |
   BoothLueker.h | Declaration of BoothLueker which implements a planarity test and planar embedding algorithm |
   BoyerMyrvold.h | Declaration of the wrapper class of the Boyer-Myrvold planarity test |
   EdgeTypePatterns.h | Edge types and patterns for planar representations |
   EmbedderMaxFace.h | Computes an embedding of a graph with maximum external face |
   EmbedderMaxFaceLayers.h | Computes an embedding of a graph with maximum external face (plus layers approach) |
   EmbedderMinDepth.h | Computes an embedding of a graph with minimum depth |
   EmbedderMinDepthMaxFace.h | Computes an embedding of a graph with minimum depth and maximum external face |
   EmbedderMinDepthMaxFaceLayers.h | Computes an embedding of a graph with minimum depth and maximum external face (plus layers approach) |
   EmbedderMinDepthPiTa.h | The algorithm computes a planar embedding with minimum depth if the embedding for all blocks of the graph is given |
   ExtractKuratowskis.h | Declaration of the class ExtractKuratowskis |
   FastPlanarSubgraph.h | Declaration of the FastPlanarSubgraph |
   FixedEmbeddingInserter.h | Declaration of class FixedEmbeddingInserter |
   KuratowskiSubdivision.h | Declaration of KuratowskiSubdivion class |
   MaximalPlanarSubgraphSimple.h | Declaration of class MaximalPlanarSubgraphSimple |
   MaximumPlanarSubgraph.h | Declaration of class MaximumPlanarSubgraph |
   MMFixedEmbeddingInserter.h | Declaration of class MMFixedEmbeddingInserter |
   MMSubgraphPlanarizer.h | Declaration of class MMSubgraphPlanarizer |
   MMVariableEmbeddingInserter.h | Declaration of class MMVariableEmbeddingInserter |
   MultiEdgeApproxInserter.h | Declaration of class MultiEdgeApproxInserter |
   NodeTypePatterns.h | Declaration of node types and patterns for planar representations |
   NonPlanarCore.h | Declaration of class NonPlanarCore which represents the non-planar core reduction for biconnected graphs |
   PlanarizationGridLayout.h | Declaration of planarization with grid layout |
   PlanarizationLayout.h | Declaration of class PlanarizationLayout |
   PlanRep.h | Declaration of a base class for planar representations of graphs and cluster graphs |
   PlanRepExpansion.h | Declaration of class PlanRepExpansion representing a planarized representation of the expansion of a graph |
   PlanRepInc.h | Declaration of class PlanRepInc |
   PlanRepUML.h | Declaration of class PlanRepUML |
   SimpleEmbedder.h | A simple embedder algorithm |
   SimpleIncNodeInserter.h | Declaration of class SimpleIncNodeInserter |
   SubgraphPlanarizer.h | Declaration of class SubgraphPlanarizer |
   VariableEmbeddingInserter.h | Declaration of class VariablEmbeddingInserter |
   VariableEmbeddingInserter2.h | Declaration of class VariableEmbeddingInserter2 |
  planarlayout | |
   BiconnectedShellingOrder.h | Declares the class BiconnectedShellingOrder.. |
   FPPLayout.h | Declaration of the Fraysseix, Pach, Pollack Algorithm (FPPLayout) algorithm |
   MixedModelLayout.h | Declaration of Mixed-Model layout algorithm |
   MMCBBase.h | Declaration of base class for certain Mixed-Model crossings beautifier |
   MMCBDoubleGrid.h | Declaration of a Mixed-Model crossings beautifier that uses grid doubling |
   MMCBLocalStretch.h | Declaration of a Mixed-Model crossings beautifier that local stretching |
   PlanarDrawLayout.h | Declaration of class PlanarDrawLayout which represents a planar straight-line drawing algorithm |
   PlanarStraightLayout.h | Declaration of class PlanarStraightLayout which represents a planar straight-line drawing algorithm |
   SchnyderLayout.h | Declaration of the Schnyder Layout Algorithm (SchnyderLayout) algorithm |
   ShellingOrder.h | Declares classes ShellingOrderSet and ShellingOrder |
   TriconnectedShellingOrder.h | Declares the class TriconnectedShellingOrder.. |
  simultaneous | |
   SimDraw.h | Base class for simultaneous drawing |
   SimDrawCaller.h | Offers variety of possible algorithm calls for simultaneous drawing |
   SimDrawColorizer.h | Offers colorizer for SimDraw |
   SimDrawCreator.h | Offers variety of possible SimDraw creations |
   SimDrawCreatorSimple.h | Offers simple SimDraw creations |
   SimDrawManipulatorModule.h | Module for simdraw manipulator classes |
   TwoLayerCrossMinSimDraw.h | Declaration of interface for two-layer crossing minimization algorithms for Simultaneous Drawing |
  tree | |
   RadialTreeLayout.h | Declaration of linear time layout algorithm for free trees (class RadialTreeLayout) |
   TreeLayout.h | Declaration of linear time layout algorithm for trees (TreeLayout) based on Walker's algorithm |
  upward | |
   DominanceLayout.h | Declaration of dominance layout algorithm |
   ExpansionGraph.h | Declares class ExpansionGraph.. |
   FaceSinkGraph.h | Declaration of class FaceSinkGraph |
   FeasibleUpwardPlanarSubgraph.h | Declaration of class FeasibleUpwardPlanarSubgraph which computes an feasible upward planar subgraph and a feasible upward embedding |
   FixedEmbeddingUpwardEdgeInserter.h | Declaration of class FixedEmbeddingInserter |
   FixedUpwardEmbeddingInserter.h | Declaration of class FeasibleUpwardPlanarSubgraph which computes an feasible upward planar subgraph and a feasible upward embedding |
   FUPSSimple.h | Declaration of the FastPlanarSubgraph |
   LayerBasedUPRLayout.h | Declaration of upward planarization layout algorithm |
   SubgraphUpwardPlanarizer.h | Declaration of class SubgraphPlanarizer |
   UpwardPlanarizationLayout.h | Declaration of upward planarization layout algorithm |
   UpwardPlanarModule.h | Declaration of class UpwardPlanarModule, which implements the upward-planarity testing and embedding algorithm for single-source digraphs by Bertolazzi et al |
   UpwardPlanarSubgraphSimple.h | Declaration of class UpwardPlanarSubgraphSimple which computes an upward planar subgfraph by using UpwardPlanarModule |
   UpwardPlanRep.h | Declaration of a base class for planar representations of graphs and cluster graphs |
   VisibilityLayout.h | Declaration of visibility layout algorithm |