Open
Graph Drawing
Framework

 v.2010.10
 

File List

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