# OpenGraph DrawingFramework

v.2012.07

Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12345]
 ogdf::Array< List< edge > > ogdf::Array< node > ogdf::Array< Prioritized< X *, Priority >, INDEX > ogdf::Array< T > ogdf::BinaryHeapSimple< Prioritized< X *, Priority >, INDEX > ogdf::BucketFunc< edge > ogdf::BucketFunc< node > ogdf::GenericPoint< double > ogdf::GenericPoint< int > ogdf::HyperGraph::GraphArrayBase< AdjElement > ogdf::HyperGraph::GraphArrayBase< EdgeElement > ogdf::HyperGraph::GraphArrayBase< NodeElement > ogdf::HashConstIterator< Tuple2< I1_, I2_ >, E_, HashFuncTuple< I1_, I2_, Hash1_, Hash2_ > > ogdf::HashFuncTuple< I1, I2, H1, H2 > ogdf::HashFuncTuple< I1_, I2_, Hash1_, Hash2_ > ogdf::HeapBase< key, HeapObject > ogdf::ListElement< DPoint > ogdf::ListElement< edge > ogdf::ListElement< Group > ogdf::ListElement< IPoint > ogdf::ListElement< PQNode< edge, IndInfo *, bool > * > ogdf::ListElement< PQNode< edge, whaInfo *, bool > * > ogdf::ListElement< PQNode< edge, X, bool > * > ogdf::ListElement< PQNode< T, whaInfo *, Y > * > ogdf::ListPure< DPoint > ogdf::ListPure< edge > ogdf::ListPure< Group > ogdf::ListPure< IPoint > ogdf::ListPure< PQNode< edge, IndInfo *, bool > * > ogdf::ListPure< PQNode< edge, whaInfo *, bool > * > ogdf::ListPure< PQNode< edge, X, bool > * > ogdf::ListPure< PQNode< T, whaInfo *, Y > * > ogdf::AcyclicSubgraphModule Base class of algorithms for computing a maximal acyclic subgraph ogdf::AddNodeComparer Node comparer for sorting by decreasing int values ogdf::AdjacencyOracle Tells you in linear time if two nodes are adjacent ogdf::AdjEntryArrayBase Abstract base class for adjacency entry arrays ogdf::AnyOption ogdf::Array< E, INDEX > The parameterized class Array implements dynamic arrays of type E ogdf::Array2D< E > The parameterized class Array2D implements dynamic two-dimensional arrays ogdf::AugmentationModule The base class for graph augmentation algorithms ogdf::Barrier Representation of a barrier ogdf::BaseConstraint Basic constraint type ogdf::BasicPageRank Basic page rank calculation ogdf::BCTree Static BC-trees ogdf::BendString ogdf::BinaryHeap< X, Priority, INDEX > ogdf::BinaryHeap2< key, HeapObject >::HeapEntry ogdf::BinaryHeap< X, Priority, INDEX >::Element ogdf::BinaryHeapSimple< X, INDEX > Dynamically growing binary heap tuned for efficiency on a small interface (compared to BinaryHeap) ogdf::BoundedQueue< E, INDEX > The parameterized class BoundedQueue implements queues with bounded size ogdf::BoundedStack< E, INDEX > The parameterized class BoundedStack implements stacks with bounded size ogdf::BoyerMyrvoldInit This class is used in the Boyer-Myrvold planarity test for preprocessing purposes ogdf::BoyerMyrvoldPlanar This class implements the extended BoyerMyrvold planarity embedding algorithm ogdf::BucketFunc< E > Abstract base class for bucket functions ogdf::CCLayoutPackModule Base class of algorithms that arrange/pack layouts of connected components ogdf::CconnectClusterPlanar ogdf::CconnectClusterPlanarEmbed ogdf::CliqueFinder Finds cliques and dense subgraphs ogdf::ClusterArrayBase Abstract base class for cluster arrays ogdf::ClustererModule Interface for algorithms that compute a clustering for a given graph ogdf::ClusterGraphCopyAttributes Manages access on copy of an attributed clustered graph ogdf::ClusterGraphObserver ogdf::ClusterInfo Stores information associated with a cluster ogdf::ClusterOrthoShaper ogdf::ClusterPlanarizationLayout The cluster planarization layout algorithm ogdf::ClusterPlanarizationLayout::ClusterPosition ogdf::ClusterPQContainer ogdf::ClusterSet ogdf::ClusterSetPure ogdf::ClusterSetSimple ogdf::CoffmanGrahamRanking::_int_set ogdf::CoinCallbacks ogdf::CoinManager ogdf::CompactionConstraintGraph< ATYPE >::Interval ogdf::CompactionConstraintGraph< ATYPE >::SegmentComparer ogdf::ConnectedSubgraph< T > ogdf::ConstCombinatorialEmbedding Combinatorial embeddings of planar graphs ogdf::Constraint ogdf::ConstraintManager ogdf::ConvexHull ogdf::CPlanarEdgeInserter ogdf::CPlanarSubClusteredGraph Constructs a c-planar subclustered graph of the input on base of a spanning tree ogdf::CPlanarSubClusteredST Constructs a c-planar subclustered spanning tree of the input by setting edgearray values ogdf::CriticalSection Representation of a critical section ogdf::CrossingsMatrix ogdf::DavidsonHarel The Davidson-Harel approach for drawing graphs ogdf::DefHashFunc< K > Default hash functions ogdf::DefHashFunc< double > Specialized default hash function for double ogdf::DefHashFunc< IPoint > ogdf::DefHashFunc< String > ogdf::DefHashFunc< void * > Specialized default hash function for pointer types ogdf::Dijkstra< T > Dijkstra's single source shortest path algorithm ogdf::DinoLineBuffer ogdf::DinoLineBufferPosition ogdf::DinoTools ogdf::DinoUmlDiagramGraph ogdf::DinoUmlToGraphConverter ogdf::DinoXmlParser ogdf::DinoXmlScanner ogdf::DisjointSets< Element, linkOption, compressionOption, interleavingOption > A Union/Find data structure for maintaining disjoint sets ogdf::DLine Lines with real coordinates ogdf::DRect Rectangles with real coordinates ogdf::DScaler Scaling between coordinate systems ogdf::DynamicBacktrack Extracts all possible paths with backtracking using given edges and special constraints ogdf::EdgeArrayBase Abstract base class for edge arrays ogdf::EdgeAttributes ogdf::EdgeLabel< coordType > ogdf::EdgeLeg ogdf::EdgeRouter ogdf::edgeValue ogdf::EdgeVar ogdf::EFreeList< E, next > Simple implementation of a FreeList which buffers the memory allocation of an embedded list item ogdf::EFreeListIndexPool< E, next, index > More complex implementation of a FreeList, which is able to generate indeices for the elements ogdf::EFreeListTypes< E, next > Type declarations for EFreeList ogdf::ELabelInterface< coordType > ogdf::ELabelPos< coordType > ogdf::ELabelPos< coordType >::FeatureComparer ogdf::ELabelPos< coordType >::FeatureInfo ogdf::ELabelPos< coordType >::FeatureLink ogdf::ELabelPos< coordType >::LabelInfo ogdf::ELabelPos< coordType >::PosInfo ogdf::ELabelPos< coordType >::SegmentInfo ogdf::ELabelPosSimple ogdf::EList< L, E, numElem, first, last, next, prev > The embedded list template ogdf::EListIterator< E, prev, next > Implementation of an embedded list iterator used by EList ogdf::EmbedderMaxFaceBiconnectedGraphs< T > Computes an embedding of a biconnected graph with maximum external face ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T > Computes an embedding of a biconnected graph with maximum external face (plus layers approach) ogdf::EnergyFunction The interface for energy functions for the Davidson Harel graph drawing method ogdf::ENGLayer ogdf::EStack< S, E, first, next > The embedded stack class template ogdf::Exception Base class of all ogdf exceptions ogdf::ExternE List of externally active nodes strictly between x and y for minortypes B and E ogdf::ExtractKuratowskis Extracts multiple Kuratowski Subdivisions ogdf::FaceArrayBase Abstract base class for face arrays ogdf::FaceSet Maintains a subset S of the faces contained in an associated combinatorial embedding E ogdf::FaceSetPure Maintains a subset S of the faces contained in an associated combinatorial embedding E ogdf::FaceSetSimple Maintains a subset S of the faces contained in an associated combinatorial embedding E ogdf::FindKuratowskis This class collects information about Kuratowski Subdivisions which is used for extraction later ogdf::FlowCompaction Compaction algorithm using min-cost flow in the dual of the constraint graph ogdf::FruchtermanReingold ogdf::GenericPoint< NUMBER > Parameterized base class for points ogdf::GmlObject ogdf::GmlParser ogdf::Graph Data type for general directed graphs (adjacency list representation) ogdf::GraphAttributes Stores additional attributes of a graph (like layout information) ogdf::GraphConstraints ogdf::GraphCopyAttributes ogdf::GraphElement The base class for objects used by graphs like nodes, edges, etc ogdf::GraphListBase Base class for GraphElement lists ogdf::GraphObserver Abstract Base class for classes that need to keep track of changes in the graph like addition/deletion of nodes or edges. derived classes have to overload nodeDeleted, nodeAdded edgeDeleted, edgeAdded these functions should be called by Graph before (delete) ogdf::GridLayout Representation of a graph's grid layout ogdf::HashConstIterator< K, I, H > Iterators for hash tables ogdf::HashElementBase Base class for elements within a hash table ogdf::HashFuncTuple< K1_, K2_, Hash1_, Hash2_ > ogdf::HashingBase Base class for hashing with chaining and table doubling ogdf::HeapBase< Priority, HeapObject > ogdf::HeapElement< Score, X > ogdf::Hierarchy Representation of proper hierarchies used by Sugiyama-layout ogdf::HierarchyClusterLayoutModule Interface of hierarchy layout algorithms for cluster graphs ogdf::HierarchyLayoutModule Interface of hierarchy layout algorithms ogdf::HyperGraph ogdf::HyperGraph::AdjElement Representation of adjacency elements ogdf::HyperGraph::ArrayController< ElementType > Array controllers manage the graph arrays of an element ogdf::HyperGraph::ArrayControllerTypes< ElementType > ogdf::HyperGraph::EdgeElement Representation of hyper edges ogdf::HyperGraph::GraphArrayBase< E > ogdf::HyperGraph::NodeElement Representation of node elements ogdf::HyperGraphTypes Type declarations for HyperGraph ogdf::IncNodeInserter ogdf::IndInfo ogdf::Initialization ogdf::InitialPlacer ogdf::IntersectionRectangle ogdf::KuratowskiConstraint ogdf::KuratowskiStructure A Kuratowski Structure is a special graph structure containing severals subdivisions ogdf::KuratowskiWrapper Wrapper-class for Kuratowski Subdivisions containing the minortype and edgelist ogdf::LayerBasedUPRLayout::RankComparer ogdf::Layout Stores a layout of a graph (coordinates of nodes, bend points of edges) ogdf::LayoutClusterPlanRepModule Interface for planar cluster layout algorithms ogdf::LayoutModule Interface of general layout algorithms ogdf::LayoutPlanRepModule Interface for planar UML layout algorithms ogdf::Level Representation of levels in hierarchies ogdf::LHTreeNode ogdf::LHTreeNode::Adjacency ogdf::LHTreeNode::ClusterCrossing ogdf::ListConstIterator< E > The parameterized class ListIterator encapsulates a constant pointer to a list element ogdf::ListElement< E > The parameterized class ListElement represents the structure for elements of doubly linked lists ogdf::ListIterator< E > The parameterized class ListIterator encapsulates a pointer to a dlist element ogdf::ListPure< E > The parameterized class ListPure represents doubly linked lists with content type E ogdf::Logger Centralized global and local logging facility working on streams like cout ogdf::LongestPathCompaction Compaction algorithm using longest paths in the constraint graph ogdf::LPSolver ogdf::MallocMemoryAllocator Implements a simple memory manager using malloc() and free() ogdf::MallocMemoryAllocator::MemElem ogdf::Master ogdf::Math ogdf::MaxPlanarEdgesConstraint ogdf::MDMFLengthAttribute ogdf::MinCostFlowModule Interface for min-cost flow algorithms ogdf::MinCostFlowReinelt::arctype ogdf::MinCostFlowReinelt::nodetype ogdf::MinCut ogdf::MinimalClusterConnection ogdf::MinimumEdgeDistances< ATYPE > ogdf::MinimumEdgeDistances< ATYPE >::InfoType ogdf::MinPriorityQueue< Score, X > ogdf::MixedModelCrossingsBeautifierModule The base class for Mixed-Model crossings beautifier algorithms ogdf::MMVariableEmbeddingInserter::AnchorNodeInfo ogdf::MMVariableEmbeddingInserter::Paths ogdf::Module Base class for modules ogdf::ModuleOption< M > The parameterized base class for module options ogdf::MultiEdgeApproxInserter::VertexBlock ogdf::MultilevelBuilder ogdf::MultilevelGraph ogdf::NearestRectangleFinder ogdf::NearestRectangleFinder::PairRectDist ogdf::NearestRectangleFinder::RectRegion ogdf::NMM ogdf::NodeArrayBase Abstract base class for node arrays ogdf::NodeAttributes ogdf::NodeComparer< sorterType > ogdf::NodeInfo ogdf::NodeMerge ogdf::nodePair Struct for storing the two corresponding nodes of an edge ogdf::NodePair ogdf::NodeSet ogdf::NodeSetPure ogdf::NodeSetSimple ogdf::NonPlanarCore ogdf::Ogml ogdf::OgmlParser ogdf::OrderComparer ogdf::OrthoRep ogdf::OrthoRep::SideInfoUML ogdf::OrthoRep::VertexInfoUML ogdf::OrthoShaper ogdf::PALabel Auxiliary class for the planar augmentation algorithm ogdf::ParticleInfo ogdf::ParticleInfoComparer ogdf::PertinentGraph Pertinent graphs of nodes in an SPQR-tree ogdf::Planarity::ChangedCrossing ogdf::PlanarityModule Module for planarity testing and planar embeddings ogdf::PlanRep::Deg1RestoreInfo Information for restoring degree-1 nodes ogdf::PlanRepExpansion::Crossing ogdf::PlanRepExpansion::NodeSplit Representation of a node split in a planarized expansion ogdf::PointComparer ogdf::PoolMemoryAllocator The class PoolAllocator represents ogdf's pool memory allocator ogdf::PoolMemoryAllocator::MemElem ogdf::PoolMemoryAllocator::MemElemEx ogdf::PQBasicKeyRoot ogdf::PQNodeRoot ogdf::PQTree< T, X, Y > ogdf::PreprocessorLayout::EdgeData Deleted Edges are stored in EdgeData ogdf::Prioritized< X, Priority > Augments any data elements of type X with keys of type Score ogdf::ProcrustesPointSet ogdf::QuadTreeNM ogdf::QuadTreeNodeNM ogdf::RadialTreeLayout::Group ogdf::RankingModule Interface of algorithms for computing a node ranking ogdf::RCCrossings ogdf::RoutingChannel< ATYPE > ogdf::RoutingChannel< ATYPE >::vInfo ogdf::ShellingOrder The shelling order of a graph ogdf::ShellingOrderModule Base class for modules that compute a shelling order of a graph ogdf::ShortestPathModule ogdf::SimDraw The Base class for simultaneous graph drawing ogdf::SimDrawColorizer::SimDrawColorScheme Manages the various color schemes ogdf::SimDrawManipulatorModule Interface for simdraw manipulators ogdf::SimpleCluster ogdf::Skeleton Skeleton graphs of nodes in an SPQR-tree ogdf::Skiplist< X > A randomized skiplist ogdf::Skiplist< X >::Element Internal structure to hold the items and internal forward pointers of the skiplist ogdf::SkiplistIterator< X > Forward-Iterator for Skiplists ogdf::SListConstIterator< E > The parameterized class SListIterator encapsulates a constant pointer to an slist element ogdf::SListElement< E > The parameterized class SListElement represents the structure for elements of singly linked lists ogdf::SListIterator< E > The parameterized class SListIterator encapsulates a pointer to an slist element ogdf::SListPure< E > The parameterized class SListPure represents singly linked lists with content type E ogdf::SolarMerger::PathData ogdf::SPQRTree Linear-time implementation of static SPQR-trees ogdf::SpringEmbedderFRExact::ArrayGraph ogdf::StackPure< E > List-based stacks ogdf::StackPure< E >::Element ogdf::StdComparer< E > Standard comparer (valid as a static comparer) ogdf::StdComparer< bool > Generates a specialization of the standard static comparer for booleans ogdf::SteinLibParser< T > Reads a SteinLib file and converts it into a weighted graph and a set of terminal nodes ogdf::String Representation of character strings ogdf::Sub ogdf::SubgraphPlanarizer::CrossingStructure ogdf::System System specific functionality ogdf::TargetComparer< CONTENTTYPE, STATICCONTENTCOMPARER > A static comparer which compares the target of pointers ("content"), instead of the pointer's adresses ogdf::Thread ogdf::Timeouter Class for timeout funtionality ogdf::TopologyModule ogdf::Tuple2< E1, E2 > Tuples of two elements (2-tuples) ogdf::Tuple3< E1, E2, E3 > Tuples of three elements (3-tuples) ogdf::Tuple4< E1, E2, E3, E4 > Tuples of four elements (4-tuples) ogdf::TwoLayerCrossMin Interface of two-layer crossing minimization algorithms ogdf::UMLGraph::AssociationClass ogdf::UMLGraph::CliqueInfo ogdf::UniformGrid ogdf::UPRLayoutModule Interface of hierarchy layout algorithms ogdf::UpwardPlanarModule ogdf::UpwardPlanarModule::DegreeInfo ogdf::UpwardPlanarSubgraphModule Interface for algorithms for computing an upward planar subgraph ogdf::VComparer< E > Abstract base class for comparer classes ogdf::VisibilityLayout::EdgeSegment ogdf::VisibilityLayout::NodeSegment ogdf::WeightComparer< T > ogdf::whaInfo ogdf::WInfo Saves information about a pertinent node w between two stopping vertices ogdf::XmlAttributeObject ogdf::XmlObject ogdf::XmlParser ogdf::XmlTagObject ogdf::PQTree< edge, IndInfo *, bool > ogdf::PQTree< edge, whaInfo *, bool > ogdf::PQTree< T, whaInfo *, Y > ogdf::Prioritized< X *, Priority > ogdf::SListElement< PQNode< edge, whaInfo *, bool > * > ogdf::SListPure< PQNode< edge, whaInfo *, bool > * > ogdf::Tuple2< I1_, I2_ > ogdf::VComparer< adjEntry >