Open
Graph Drawing
Framework

 v. snapshot-2018-03-28
 

Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1234567]
 Cabacus::AbacusRootBase class of all other classes of ABACUS
 Cogdf::Array2D< bool >
 Cogdf::Array2D< double >
 Cogdf::Array2D< int >
 Cogdf::Array2D< ogdf::EdgeElement >
 Cogdf::Array2D< ogdf::ListPure< int > >
 Cogdf::Array< abacus::Constraint *, int >
 Cogdf::Array< abacus::FSVarStat *, int >
 Cogdf::Array< abacus::FSVarStat *>
 Cogdf::Array< abacus::InfeasCon *, int >
 Cogdf::Array< abacus::LPVARSTAT *>
 Cogdf::Array< abacus::PoolSlot< abacus::Constraint, abacus::Variable > *>
 Cogdf::Array< abacus::PoolSlot< abacus::Variable, abacus::Constraint > *>
 Cogdf::Array< abacus::PoolSlot< BaseType, CoType > *>
 Cogdf::Array< abacus::PoolSlotRef< abacus::Constraint, abacus::Variable > *>
 Cogdf::Array< abacus::PoolSlotRef< abacus::Variable, abacus::Constraint > *, int >
 Cogdf::Array< abacus::PoolSlotRef< abacus::Variable, abacus::Constraint > *>
 Cogdf::Array< abacus::PoolSlotRef< BaseType, CoType > *>
 Cogdf::Array< abacus::PoolSlotRef< CoType, BaseType > *>
 Cogdf::Array< abacus::SlackStat *>
 Cogdf::Array< abacus::Sub *, int >
 Cogdf::Array< ATYPE >
 Cogdf::Array< BaseType *, int >
 Cogdf::Array< BendType >
 Cogdf::Array< BlockType >
 Cogdf::Array< BNodeType >
 Cogdf::Array< bool >
 Cogdf::Array< cutType >
 Cogdf::Array< double >
 Cogdf::Array< double, int >
 Cogdf::Array< edge, int >
 Cogdf::Array< float >
 Cogdf::Array< GenericPoint< double > >
 Cogdf::Array< Graph::NodeType >
 Cogdf::Array< int >
 Cogdf::Array< int, int >
 Cogdf::Array< int64_t >
 Cogdf::Array< Key >
 Cogdf::Array< List< edge > >
 Cogdf::Array< node >
 Cogdf::Array< NodeInfo >
 Cogdf::Array< NodePair, int >
 Cogdf::Array< NodeType >
 Cogdf::Array< nodeType >
 Cogdf::Array< ogdf::AdjElement >
 Cogdf::Array< ogdf::AdjElement, int >
 Cogdf::Array< ogdf::Array< ogdf::AdjElement > >
 Cogdf::Array< ogdf::Array< ogdf::NodeElement > >
 Cogdf::Array< ogdf::ArrayBuffer< ogdf::EdgeElement > >
 Cogdf::Array< ogdf::ArrayBuffer< ogdf::NodeElement >, int >
 Cogdf::Array< ogdf::ArrayLevel *>
 Cogdf::Array< ogdf::BertaultLayout::BertaultSections >
 Cogdf::Array< ogdf::Block * >
 Cogdf::Array< ogdf::Block *>
 Cogdf::Array< ogdf::ClusterArray< int > * >
 Cogdf::Array< ogdf::ClusterElement >
 Cogdf::Array< ogdf::ClusterElement, int >
 Cogdf::Array< ogdf::CoffmanGrahamRanking::_int_set >
 Cogdf::Array< ogdf::DIntersectableRect >
 Cogdf::Array< ogdf::DRect >
 Cogdf::Array< ogdf::DynamicSkeleton * >
 Cogdf::Array< ogdf::edge_router::NodeInfo >
 Cogdf::Array< ogdf::EdgeArray< ogdf::EdgeElement > >
 Cogdf::Array< ogdf::EdgeElement >
 Cogdf::Array< ogdf::EdgeElement, int >
 Cogdf::Array< ogdf::embedder::MDMFLengthAttribute >
 Cogdf::Array< ogdf::energybased::dtree::DTreeEmbedder::NodeInfo >
 Cogdf::Array< ogdf::ENGLayer >
 Cogdf::Array< ogdf::FaceElement >
 Cogdf::Array< ogdf::fast_multipole_embedder::GalaxyMultilevel::LevelNodeInfo >
 Cogdf::Array< ogdf::fast_multipole_embedder::GalaxyMultilevelBuilder::LevelNodeState >
 Cogdf::Array< ogdf::Fill >
 Cogdf::Array< ogdf::GF2Solver::Equation *>
 Cogdf::Array< ogdf::Graph >
 Cogdf::Array< ogdf::HypernodeElement >
 Cogdf::Array< ogdf::Level *>
 Cogdf::Array< ogdf::LHTreeNode *>
 Cogdf::Array< ogdf::List< int > >
 Cogdf::Array< ogdf::List< ogdf::AdjElement > >
 Cogdf::Array< ogdf::List< ogdf::EdgeElement > * >
 Cogdf::Array< ogdf::List< ogdf::EdgeElement > *>
 Cogdf::Array< ogdf::List< ogdf::EdgeElement > >
 Cogdf::Array< ogdf::List< ogdf::InOutPoint > >
 Cogdf::Array< ogdf::List< ogdf::MultiEdgeApproxInserter::VertexBlock > >
 Cogdf::Array< ogdf::List< ogdf::NodeElement > >
 Cogdf::Array< ogdf::List< ogdf::PlanRepExpansion::Crossing > >
 Cogdf::Array< ogdf::ListIteratorBase< ogdf::FaceElement > >
 Cogdf::Array< ogdf::ListIteratorBase< ogdf::InOutPoint > >
 Cogdf::Array< ogdf::ListIteratorBase< ogdf::NodeElement > >
 Cogdf::Array< ogdf::ListIteratorBase< ogdf::PALabel > >
 Cogdf::Array< ogdf::ListPure< ogdf::NodeElement > >
 Cogdf::Array< ogdf::MinCostFlowReinelt::arctype >
 Cogdf::Array< ogdf::MinCostFlowReinelt::nodetype >
 Cogdf::Array< ogdf::MinimumEdgeDistances::InfoType >
 Cogdf::Array< ogdf::MMVariableEmbeddingInserter::AnchorNodeInfo >
 Cogdf::Array< ogdf::NodeArray< bool > >
 Cogdf::Array< ogdf::NodeArray< double > >
 Cogdf::Array< ogdf::NodeArray< int > >
 Cogdf::Array< ogdf::NodeArray< ogdf::EdgeElement > >
 Cogdf::Array< ogdf::NodeArray< ogdf::NodeElement > >
 Cogdf::Array< ogdf::NodeArray< T > >
 Cogdf::Array< ogdf::NodeElement >
 Cogdf::Array< ogdf::NodeElement, int >
 Cogdf::Array< ogdf::OrthoRep::VertexInfoUML * >
 Cogdf::Array< ogdf::PALabel >
 Cogdf::Array< ogdf::PlanRep::Deg1RestoreInfo, int >
 Cogdf::Array< ogdf::RadialTreeLayout::Grouping >
 Cogdf::Array< ogdf::RoutingChannel::vInfo >
 Cogdf::Array< ogdf::ShellingOrderSet >
 Cogdf::Array< ogdf::SList< int > >
 Cogdf::Array< ogdf::SList< ogdf::AdjElement > >
 Cogdf::Array< ogdf::SList< ogdf::EdgeElement > >
 Cogdf::Array< ogdf::SList< ogdf::MultiEdgeApproxInserter::VertexBlock > >
 Cogdf::Array< ogdf::SList< ogdf::NodeElement > >
 Cogdf::Array< ogdf::SListPure< ogdf::AdjElement > >
 Cogdf::Array< ogdf::SListPure< ogdf::booth_lueker::PlanarLeafKey > >
 Cogdf::Array< ogdf::SListPure< ogdf::EdgeElement > >
 Cogdf::Array< ogdf::SListPure< ogdf::NodeElement > >
 Cogdf::Array< ogdf::SListPure< ogdf::Tuple2< ogdf::NodeElement, int > > >
 Cogdf::Array< ogdf::StaticSkeleton * >
 Cogdf::Array< ogdf::StaticSPQRTree * >
 Cogdf::Array< ogdf::steiner_tree::FullComponentStore::Metadata< double >, int >
 Cogdf::Array< ogdf::steiner_tree::FullComponentStore::Metadata< ExtraDataType >, int >
 Cogdf::Array< ogdf::steiner_tree::FullComponentStore::Metadata< LossMetadata< T > >, int >
 Cogdf::Array< ogdf::Stroke >
 Cogdf::Array< ogdf::Triconnectivity::CompStruct >
 Cogdf::Array< ogdf::VisibilityLayout::NodeSegment >
 Cogdf::Array< ogdf::WInfo * >
 Cogdf::Array< OrthoDir >
 Cogdf::Array< PathType >
 Cogdf::Array< Prioritized< X *, Priority >, INDEX >
 Cogdf::Array< PrioritizedQueue< node, P, C, Impl >::Handle >
 Cogdf::Array< ProcessType >
 Cogdf::Array< Shape >
 Cogdf::Array< std::vector< ogdf::SolarMerger::PathData > >
 Cogdf::Array< string >
 Cogdf::Array< T >
 Cogdf::Array< T, int >
 Cogdf::Array< TCap >
 Cogdf::Array< TCost >
 Cogdf::Array< TNodeType >
 Cogdf::Array< Type >
 Cogdf::Array< unsigned int >
 Cogdf::Array< X, INDEX >
 Cbackward::Colorize
 Cbackward::details::default_delete< T >
 Cbackward::details::deleter< R, T, F >
 Cbackward::details::demangler_impl< TAG >
 Cbackward::details::handle< T, Deleter >
 Cbackward::details::hashtable< K, V >
 Cbackward::details::rm_ptr< T >
 Cbackward::details::rm_ptr< const T * >
 Cbackward::details::rm_ptr< T * >
 Cbackward::Printer
 Cbackward::ResolvedTrace::SourceLoc
 Cbackward::SignalHandling
 Cbackward::SnippetFactory
 Cbackward::SourceFile
 Cbackward::SourceFile::not_isempty
 Cbackward::SourceFile::not_isspace
 Cbackward::StackTraceImpl< TAG >
 Cbackward::Trace
 Cbackward::TraceResolverImpl< TAG >
 Cbackward::TraceResolverImpl< system_tag::unknown_tag >
 Cogdf::BinaryHeapSimple< Prioritized< X *, Priority >, INDEX >
 Cogdf::fast_multipole_embedder::BinCoeff< double >
 Cogdf::BucketFunc< edge >
 Cogdf::BucketFunc< Edge >
 Cogdf::BucketFunc< MehlhornTriple >
 Cogdf::GF2Solver::ChunkBase< chunkSize, Chunk >
 Cogdf::GF2Solver::ChunkBase< chunkSize2, Chunk2 >
 Cogdf::DefHashFunc< int >
 Cogdf::DefHashFunc< ogdf::EdgeElement >
 Cogdf::DefHashFunc< std::string >
 Cbackward::details::demangler_impl< system_tag::current_tag >
 Cogdf::DTreeMultilevelEmbedder< 2 >
 Cogdf::DTreeMultilevelEmbedder< 3 >
 CMinisat::Internal::Equal< CRef >
 Cogdf::FaceSet< false >
 Cogdf::steiner_tree::FullComponentStore< T, double >
 Cogdf::steiner_tree::FullComponentStore< T, LossMetadata< T > >
 Cogdf::GenericPoint< double >
 Cogdf::GenericPoint< int >
 Cbackward::details::handle< std::ifstream *, backward::details::default_delete< std::ifstream *> >
 Cogdf::HashConstIterator< Tuple2< I1_, I2_ >, E_, HashFuncTuple< I1_, I2_, Hash1_, Hash2_ > >
 Cogdf::HashFuncTuple< I1, I2, H1, H2 >
 Cogdf::HashFuncTuple< I1_, I2_, Hash1_, Hash2_ >
 Cogdf::HashFuncTuple< int, int, DefHashFunc< int >, DefHashFunc< int > >
 Cbackward::details::hashtable< std::string, SourceFile >
 CMinisat::Internal::Heap< Minisat::Internal::SimpSolver::ElimLt >
 CMinisat::Internal::Heap< Minisat::Internal::Solver::VarOrderLt >
 Cogdf::HeapBase< BinaryHeap< T, C >, int, T, C >
 Cogdf::HeapBase< BinomialHeap< T, C >, BinomialHeapNode< T >, T, C >
 Cogdf::HeapBase< FibonacciHeap< T, C >, FibonacciHeapNode< T >, T, C >
 Cogdf::HeapBase< PairingHeap< T, C >, PairingHeapNode< T >, T, C >
 Cogdf::HeapBase< RMHeap< T, C >, RMHeapNode< T >, T, C >
 Cogdf::ListElement< abacus::Constraint *>
 Cogdf::ListElement< abacus::Sub *>
 Cogdf::ListElement< double >
 Cogdf::ListElement< edge >
 Cogdf::ListElement< GenericPoint< double > >
 Cogdf::ListElement< GenericPoint< int > >
 Cogdf::ListElement< Group >
 Cogdf::ListElement< int >
 Cogdf::ListElement< ogdf::AdjElement >
 Cogdf::ListElement< ogdf::AdjEntryArrayBase *>
 Cogdf::ListElement< ogdf::BertaultLayout::CCElement *>
 Cogdf::ListElement< ogdf::ClusterArrayBase *>
 Cogdf::ListElement< ogdf::ClusterElement >
 Cogdf::ListElement< ogdf::ClusterGraphObserver *>
 Cogdf::ListElement< ogdf::davidson_harel::EnergyFunction *>
 Cogdf::ListElement< ogdf::davidson_harel::Planarity::ChangedCrossing >
 Cogdf::ListElement< ogdf::EdgeArrayBase *>
 Cogdf::ListElement< ogdf::EdgeElement >
 Cogdf::ListElement< ogdf::energybased::fmmm::ParticleInfo >
 Cogdf::ListElement< ogdf::energybased::fmmm::QuadTreeNodeNM *>
 Cogdf::ListElement< ogdf::FaceArrayBase *>
 Cogdf::ListElement< ogdf::Graph::HiddenEdgeSet *>
 Cogdf::ListElement< ogdf::GraphObserver *>
 Cogdf::ListElement< ogdf::HypergraphArrayBase *>
 Cogdf::ListElement< ogdf::HypergraphObserver *>
 Cogdf::ListElement< ogdf::InOutPoint >
 Cogdf::ListElement< ogdf::LeftistOrdering::Candidate >
 Cogdf::ListElement< ogdf::LHTreeNode::Adjacency >
 Cogdf::ListElement< ogdf::LHTreeNode::ClusterCrossing >
 Cogdf::ListElement< ogdf::List< ogdf::AdjElement > >
 Cogdf::ListElement< ogdf::List< ogdf::NodeElement > >
 Cogdf::ListElement< ogdf::MultiEdgeApproxInserter::VertexBlock >
 Cogdf::ListElement< ogdf::NodeArrayBase *>
 Cogdf::ListElement< ogdf::NodeElement >
 Cogdf::ListElement< ogdf::NodePair >
 Cogdf::ListElement< ogdf::NonPlanarCore::CutEdge >
 Cogdf::ListElement< ogdf::PALabel >
 Cogdf::ListElement< ogdf::PlanRepExpansion::Crossing >
 Cogdf::ListElement< ogdf::PlanRepExpansion::NodeSplit >
 Cogdf::ListElement< ogdf::PQNode< edge, IndInfo *, bool > *>
 Cogdf::ListElement< ogdf::PQNode< edge, ogdf::whaInfo *, bool > *>
 Cogdf::ListElement< ogdf::PQNode< edge, whaInfo *, bool > *>
 Cogdf::ListElement< ogdf::PQNode< T, ogdf::whaInfo *, Y > *>
 Cogdf::ListElement< ogdf::PQNode< T, whaInfo *, Y > *>
 Cogdf::ListElement< ogdf::PQNode< T, X, Y > *>
 Cogdf::ListElement< ogdf::steiner_tree::Triple< T > >
 Cogdf::ListElement< ogdf::topology_module::EdgeLeg *>
 Cogdf::ListElement< PointType >
 Cogdf::ListElement< Tuple2< node, int > >
 Cogdf::ListIteratorBase< int >
 Cogdf::ListIteratorBase< ogdf::AdjEntryArrayBase *>
 Cogdf::ListIteratorBase< ogdf::ClusterArrayBase *>
 Cogdf::ListIteratorBase< ogdf::ClusterElement >
 Cogdf::ListIteratorBase< ogdf::ClusterGraphObserver *>
 Cogdf::ListIteratorBase< ogdf::EdgeArrayBase *>
 Cogdf::ListIteratorBase< ogdf::EdgeElement >
 Cogdf::ListIteratorBase< ogdf::energybased::fmmm::ParticleInfo >
 Cogdf::ListIteratorBase< ogdf::FaceArrayBase *>
 Cogdf::ListIteratorBase< ogdf::FaceElement >
 Cogdf::ListIteratorBase< ogdf::Graph::HiddenEdgeSet *>
 Cogdf::ListIteratorBase< ogdf::GraphObserver *>
 Cogdf::ListIteratorBase< ogdf::HypergraphArrayBase *>
 Cogdf::ListIteratorBase< ogdf::HypergraphObserver *>
 Cogdf::ListIteratorBase< ogdf::InOutPoint >
 Cogdf::ListIteratorBase< ogdf::NodeArrayBase *>
 Cogdf::ListIteratorBase< ogdf::NodeElement >
 Cogdf::ListIteratorBase< ogdf::PALabel >
 Cogdf::ListIteratorBase< ogdf::PlanRepExpansion::NodeSplit >
 Cogdf::ListIteratorBase< ogdf::topology_module::EdgeLeg * >
 Cogdf::ListPure< abacus::Constraint * >
 Cogdf::ListPure< abacus::Sub * >
 Cogdf::ListPure< double >
 Cogdf::ListPure< edge >
 Cogdf::ListPure< GenericPoint< double > >
 Cogdf::ListPure< GenericPoint< int > >
 Cogdf::ListPure< Group >
 Cogdf::ListPure< int >
 Cogdf::ListPure< ogdf::AdjElement >
 Cogdf::ListPure< ogdf::AdjEntryArrayBase *>
 Cogdf::ListPure< ogdf::BertaultLayout::CCElement * >
 Cogdf::ListPure< ogdf::ClusterArrayBase *>
 Cogdf::ListPure< ogdf::ClusterElement >
 Cogdf::ListPure< ogdf::ClusterGraphObserver *>
 Cogdf::ListPure< ogdf::davidson_harel::EnergyFunction * >
 Cogdf::ListPure< ogdf::davidson_harel::Planarity::ChangedCrossing >
 Cogdf::ListPure< ogdf::EdgeArrayBase *>
 Cogdf::ListPure< ogdf::EdgeElement >
 Cogdf::ListPure< ogdf::energybased::fmmm::ParticleInfo >
 Cogdf::ListPure< ogdf::energybased::fmmm::QuadTreeNodeNM * >
 Cogdf::ListPure< ogdf::FaceArrayBase *>
 Cogdf::ListPure< ogdf::Graph::HiddenEdgeSet * >
 Cogdf::ListPure< ogdf::GraphObserver *>
 Cogdf::ListPure< ogdf::HypergraphArrayBase *>
 Cogdf::ListPure< ogdf::HypergraphObserver *>
 Cogdf::ListPure< ogdf::InOutPoint >
 Cogdf::ListPure< ogdf::LeftistOrdering::Candidate >
 Cogdf::ListPure< ogdf::LHTreeNode::Adjacency >
 Cogdf::ListPure< ogdf::LHTreeNode::ClusterCrossing >
 Cogdf::ListPure< ogdf::List< ogdf::AdjElement > >
 Cogdf::ListPure< ogdf::List< ogdf::NodeElement > >
 Cogdf::ListPure< ogdf::MultiEdgeApproxInserter::VertexBlock >
 Cogdf::ListPure< ogdf::NodeArrayBase *>
 Cogdf::ListPure< ogdf::NodeElement >
 Cogdf::ListPure< ogdf::NodePair >
 Cogdf::ListPure< ogdf::NonPlanarCore::CutEdge >
 Cogdf::ListPure< ogdf::PALabel >
 Cogdf::ListPure< ogdf::PlanRepExpansion::Crossing >
 Cogdf::ListPure< ogdf::PlanRepExpansion::NodeSplit >
 Cogdf::ListPure< ogdf::PQNode< edge, IndInfo *, bool > * >
 Cogdf::ListPure< ogdf::PQNode< edge, ogdf::whaInfo *, bool > * >
 Cogdf::ListPure< ogdf::PQNode< edge, whaInfo *, bool > * >
 Cogdf::ListPure< ogdf::PQNode< T, ogdf::whaInfo *, Y > * >
 Cogdf::ListPure< ogdf::PQNode< T, whaInfo *, Y > * >
 Cogdf::ListPure< ogdf::PQNode< T, X, Y > * >
 Cogdf::ListPure< ogdf::steiner_tree::Triple< T > >
 Cogdf::ListPure< ogdf::topology_module::EdgeLeg * >
 Cogdf::ListPure< PointType >
 Cogdf::ListPure< Tuple2< node, int > >
 CMinisat::Internal::Map< CRef, T, CRefHash >
 Cogdf::MaxFlowModule< double >
 Cogdf::MaxFlowModule< int >
 Cogdf::MaxFlowModule< TCap >
 Cogdf::steiner_tree::FullComponentStore< T, ExtraDataType >::Metadata< double >
 Cogdf::steiner_tree::FullComponentStore< T, ExtraDataType >::Metadata< ExtraDataType >
 Cogdf::steiner_tree::FullComponentStore< T, ExtraDataType >::Metadata< LossMetadata< T > >
 Cogdf::MinimumEdgeDistances< int >
 CMinisat::ClauseRepresents a simple class for clause storage
 CMinisat::Internal::BoolOption
 CMinisat::Internal::Clause
 CMinisat::Internal::CMap< T >
 CMinisat::Internal::CMap< T >::CRefHash
 CMinisat::Internal::DeepEqual< K >
 CMinisat::Internal::DeepHash< K >
 CMinisat::Internal::DoubleOption
 CMinisat::Internal::DoubleRange
 CMinisat::Internal::Equal< K >
 CMinisat::Internal::Hash< K >
 CMinisat::Internal::Heap< Comp >
 CMinisat::Internal::IntOption
 CMinisat::Internal::IntRange
 CMinisat::Internal::lbool
 CMinisat::Internal::LessThan_default< T >
 CMinisat::Internal::Lit
 CMinisat::Internal::Map< K, D, H, E >
 CMinisat::Internal::Map< K, D, H, E >::Pair
 CMinisat::Internal::OccLists< Idx, Vec, Deleted >
 CMinisat::Internal::OutOfMemoryException
 CMinisat::Internal::Queue< T >
 CMinisat::Internal::RegionAllocator< T >
 CMinisat::Internal::SimpSolver::ClauseDeleted
 CMinisat::Internal::SimpSolver::ElimLt
 CMinisat::Internal::Solver
 CMinisat::Internal::Solver::SolverStatus
 CMinisat::Internal::Solver::VarData
 CMinisat::Internal::Solver::VarOrderLt
 CMinisat::Internal::Solver::Watcher
 CMinisat::Internal::Solver::WatcherDeleted
 CMinisat::Internal::vec< T >
 CMinisat::ModelRepresents a simple class for model storage
 Cogdf::MinSteinerTreeModule< double >
 Cogdf::NodeSet< false >
 Cogdf::NonPlanarCore< Cost >
 CMinisat::Internal::OccLists< Minisat::Internal::Lit, Minisat::Internal::vec< Minisat::Internal::Solver::Watcher >, Minisat::Internal::Solver::WatcherDeleted >
 CMinisat::Internal::OccLists< Var, Minisat::Internal::vec< CRef >, Minisat::Internal::SimpSolver::ClauseDeleted >
 Cogdf::AcyclicSubgraphModuleBase class of algorithms for computing a maximal acyclic subgraph
 Cogdf::AdjacencyOracleTells you in constant time if two nodes are adjacent
 Cogdf::AdjEntryArrayBaseAbstract base class for adjacency entry arrays
 Cogdf::Array< E, INDEX >The parameterized class Array implements dynamic arrays of type E
 Cogdf::Array2D< E >The parameterized class Array2D implements dynamic two-dimensional arrays
 Cogdf::ArrayReverseIteratorBase< E, isConst >Random-access reverse iterator based on a pointer to an array element
 Cogdf::AStarSearch< T >A-Star informed search algorithm
 Cogdf::AugmentationModuleThe base class for graph augmentation algorithms
 Cogdf::BarrierRepresentation of a barrier
 Cogdf::BasicPageRankBasic page rank calculation
 Cogdf::BCTreeStatic BC-trees
 Cogdf::BendStringRepresents the bends on an edge e consisting of vertical and horizontal segments
 Cogdf::BertaultLayout::BertaultSectionsThe sections associated with each node
 Cogdf::BertaultLayout::CCElementObjects of this class are members of the containment heirarchy made in preprocessing stage of ImPrEd
 Cogdf::BertaultLayout::projStructure which stores the projection of a node on an edge
 Cogdf::BinaryHeap< T, C >::HeapEntry
 Cogdf::BinaryHeapSimple< X, INDEX >Dynamically growing binary heap tuned for efficiency on a small interface (compared to BinaryHeap)
 Cogdf::BinomialHeapNode< T >Binomial heap node
 Cogdf::BitonicOrdering
 Cogdf::BlockClass representing idea of Blocks used in GlobalSifting and GridSifting algorithms
 Cogdf::booth_lueker::IndInfo
 Cogdf::BoundedQueue< E, INDEX >The parameterized class BoundedQueue implements queues with bounded size
 Cogdf::boyer_myrvold::BoyerMyrvoldInitThis class is used in the Boyer-Myrvold planarity test for preprocessing purposes
 Cogdf::BoyerMyrvoldPlanarThis class implements the extended BoyerMyrvold planarity embedding algorithm
 Cogdf::BucketFunc< E >Abstract base class for bucket functions
 Cogdf::CCLayoutPackModuleBase class of algorithms that arrange/pack layouts of connected components
 Cogdf::CconnectClusterPlanarC-planarity test by Cohen, Feng and Eades
 Cogdf::CconnectClusterPlanarEmbedC-planarity test and embedding by Cohen, Feng and Eades
 Cogdf::CliqueFinderFinds cliques and dense subgraphs
 Cogdf::cluster_planarity::ClusterPQContainer
 Cogdf::cluster_planarity::CPlanaritySub::KuraSize
 Cogdf::cluster_planarity::CPlanarSubClusteredSTConstructs a c-planar subclustered spanning tree of the input by setting edgearray values
 Cogdf::cluster_planarity::edgeValueStruct for attaching the current lp-value to the corresponding edge. Used in the primal heuristic
 Cogdf::ClusterAnalysis
 Cogdf::ClusterArrayBaseAbstract base class for cluster arrays
 Cogdf::ClustererModuleInterface for algorithms that compute a clustering for a given graph
 Cogdf::ClusterGraphCopyAttributesManages access on copy of an attributed clustered graph
 Cogdf::ClusterGraphObserverAbstract base class for cluster graph observers
 Cogdf::ClusterInfoStores information associated with a cluster
 Cogdf::ClusterOrthoShaperComputes the orthogonal representation of a clustered graph
 Cogdf::ClusterPlanarizationLayoutThe cluster planarization layout algorithm
 Cogdf::ClusterPlanarizationLayout::ClusterPosition
 Cogdf::ClusterSetCluster sets
 Cogdf::ClusterSetPureCluster sets
 Cogdf::ClusterSetSimpleSimple cluster sets
 Cogdf::CoffmanGrahamRanking::_int_set
 Cogdf::CoinManagerIf you use COIN-OR, you should use this class
 Cogdf::ColorColors represented as RGBA values
 Cogdf::CompactionConstraintGraph< ATYPE >::IntervalRepresents an interval on the sweep line
 Cogdf::CompactionConstraintGraph< ATYPE >::SegmentComparerComparer class used for sorting segments by increasing position (given by segPos) such that two overlapping segments come in the order imposed by the embedding (given by secSort: segment which comes first has secSort = 0, the other has 1)
 Cogdf::ConfigurationProvides information about how OGDF has been configured
 Cogdf::ConnectivityTesterNaive implementation for testing the connectivity of a graph
 Cogdf::ConstCombinatorialEmbeddingCombinatorial embeddings of planar graphs
 Cogdf::ConvexHullComputes the convex hull of a set of points or a layout
 Cogdf::CPlanarEdgeInserterEdge insertion algorithm for clustered graphs
 Cogdf::CPlanarSubClusteredGraphConstructs a c-planar subclustered graph of the input based on a spanning tree
 Cogdf::CrossingsMatrixImplements crossings matrix which is used by some TwoLayerCrossingMinimization heuristics (e.g. split)
 Cogdf::davidson_harel::EnergyFunctionThe interface for energy functions for the Davidson Harel graph drawing method
 Cogdf::davidson_harel::Planarity::ChangedCrossing
 Cogdf::davidson_harel::UniformGrid
 Cogdf::DavidsonHarelThe Davidson-Harel approach for drawing graphs
 Cogdf::DefHashFunc< K >Default hash functions
 Cogdf::DefHashFunc< double >Specialized default hash function for double
 Cogdf::DefHashFunc< IPoint >
 Cogdf::DefHashFunc< string >Specialized default hash function for string
 Cogdf::DefHashFunc< void * >Specialized default hash function for pointer types
 Cogdf::Dijkstra< T, H >Dijkstra's single source shortest path algorithm
 Cogdf::disjoint_sets::AnyOption
 Cogdf::DisjointSets< linkOption, compressionOption, interleavingOption >A Union/Find data structure for maintaining disjoint sets
 Cogdf::DLParser
 Cogdf::dot::AstDOT format abstract syntax tree class, based on official documentation
 Cogdf::dot::Ast::AList
 Cogdf::dot::Ast::AttrList
 Cogdf::dot::Ast::CompassPt
 Cogdf::dot::Ast::EdgeLhs
 Cogdf::dot::Ast::EdgeRhs
 Cogdf::dot::Ast::Graph
 Cogdf::dot::Ast::Port
 Cogdf::dot::Ast::Stmt
 Cogdf::dot::Ast::StmtList
 Cogdf::dot::LexerLexical analysis tool
 Cogdf::dot::ParserDOT format parser class
 Cogdf::dot::SubgraphDataA helper structure containing information for recursive graph reading
 Cogdf::dot::TokenJust a simple token struct representing a DOT file fragment
 Cogdf::DRectRectangles with real coordinates
 Cogdf::DTreeMultilevelEmbedder< Dim >
 Cogdf::DTreeMultilevelEmbedder< Dim >::NodeCoords
 Cogdf::edge_router::NodeInfo
 Cogdf::EdgeArrayBaseAbstract base class for edge arrays
 Cogdf::EdgeLabel< coordType >
 Cogdf::EdgeRouterPlaces node boxes in replacement areas of orthogonal drawing step and route edges to minimize bends
 Cogdf::ELabelInterface< coordType >
 Cogdf::ELabelPosSimple
 Cogdf::embedder::ConnectedSubgraph< T >
 Cogdf::embedder::CrossingStructure
 Cogdf::embedder::MDMFLengthAttributeAuxiliary length attribute
 Cogdf::EmbedderMaxFaceBiconnectedGraphs< T >Embedder that maximizing the external face
 Cogdf::energybased::dtree::DTree< IntType, Dim >Implentation of the reduced quadtree for Dim dimensions
 Cogdf::energybased::dtree::DTree< IntType, Dim >::MortonEntryThe entry in the sorted order for a point
 Cogdf::energybased::dtree::DTree< IntType, Dim >::NodeThe node class
 Cogdf::energybased::dtree::DTree< IntType, Dim >::PointThe point class with integer coords
 Cogdf::energybased::dtree::DTreeEmbedder< Dim >
 Cogdf::energybased::dtree::DTreeEmbedder< Dim >::NodeInfoNode state
 Cogdf::energybased::dtree::DTreeForce< Dim >
 Cogdf::energybased::dtree::DTreeForce< Dim >::NodeDataNode data
 Cogdf::energybased::dtree::DTreeForce< Dim >::PointDataPoint data
 Cogdf::energybased::dtree::DTreeWSPD< Dim >
 Cogdf::energybased::dtree::DTreeWSPD< Dim >::NodeDataGeometry for the quadtree nodes
 Cogdf::energybased::dtree::DTreeWSPD< Dim >::PointDataWorld coordinates of the points
 Cogdf::energybased::dtree::GalaxyLevelSimple implementation of the slightly modified version of Hachul by Gronemann
 Cogdf::energybased::dtree::IWSPD
 Cogdf::energybased::fmmm::EdgeHelping data structure for deleting parallel edges in class FMMMLayout and Multilevel (needed for the bucket sort algorithm)
 Cogdf::energybased::fmmm::EdgeAttributesHelping data structure that stores the graphical attributes of an edge that are needed for the force-directed algorithms
 Cogdf::energybased::fmmm::FruchtermanReingold
 Cogdf::energybased::fmmm::MAARPackingData structure for packing rectangles within an area of a desired aspect ratio without overlappings; optimization goal: to minimize the used aspect ratio area
 Cogdf::energybased::fmmm::Multilevel
 Cogdf::energybased::fmmm::NewMultipoleMethod
 Cogdf::energybased::fmmm::NodeData structure for representing nodes and an int value (needed for class ogdf/list) to perform bucket sort
 Cogdf::energybased::fmmm::NodeAttributesHelping data structure that stores the graphical attributes of a node that are needed for the force-directed algorithms
 Cogdf::energybased::fmmm::numexceptThis class is developed for exceptions that might occure, when nodes are placed at the same position and a new random position has to be found, or when the calculated forces are near the machine accuracy, where no reasonable numeric and logic calculations are possible any more
 Cogdf::energybased::fmmm::PackingRowInfoHelping data structure for MAARPacking
 Cogdf::energybased::fmmm::ParticleInfoHelping data structure for building up the reduced quad tree by NMM
 Cogdf::energybased::fmmm::QuadTreeNMHelping data structure that stores the information needed to represent the modified quadtree in the New Multipole Method (NMM)
 Cogdf::energybased::fmmm::QuadTreeNodeNMHelping data structure that stores the information needed to represent a node of the reduced quad tree in the New Multipole Method (NMM)
 Cogdf::energybased::fmmm::RectangleHelping data structure for packing rectangles; The width, height and the position of the down left corner of the tight surroundig rectangle is represented for each connected component of the graph
 Cogdf::energybased::fmmm::SetHelping data structure that holds set S_node of nodes in the range [0, G.number_of_nodes()-1] (needed for class Multilevel) for randomly choosing nodes (with uniform or weighted probability!)
 Cogdf::ENGLayerRepresents layer in an extended nesting graph
 Cogdf::EpsilonTest
 Cogdf::ExceptionBase class of all ogdf exceptions
 Cogdf::ExternEList of externally active nodes strictly between x and y for minortypes B and E
 Cogdf::ExtractKuratowskisExtracts multiple Kuratowski Subdivisions
 Cogdf::FaceArrayBaseAbstract base class for face arrays
 Cogdf::FaceSet< SupportFastSizeQuery >Face sets
 Cogdf::fast_multipole_embedder::ArrayGraph
 Cogdf::fast_multipole_embedder::ArrayPartition
 Cogdf::fast_multipole_embedder::BinCoeff< TYP >Binomial coeffs from Hachuls FMMM
 Cogdf::fast_multipole_embedder::CollectForceFunctor< FLAGS >
 Cogdf::fast_multipole_embedder::composition_functor< FuncFirst, FuncSecond >Functor for composing two other functors
 Cogdf::fast_multipole_embedder::const_condition< result >Condition functor for returning a constant boolean value
 Cogdf::fast_multipole_embedder::D2DFunctorCalculates the repulsive forces acting between all nodes of the direct interacting cells of the i-th node
 Cogdf::fast_multipole_embedder::do_nothingUseless do nothing function
 Cogdf::fast_multipole_embedder::EdgeAdjInfoInformation about an edge (16 bytes)
 Cogdf::fast_multipole_embedder::EdgeForceFunctor< FLAGS >
 Cogdf::fast_multipole_embedder::EmptyArgType
 Cogdf::fast_multipole_embedder::FMEBasicKernel
 Cogdf::fast_multipole_embedder::FMEGlobalContextGlobal Context
 Cogdf::fast_multipole_embedder::FMEGlobalOptionsMain global options for a run
 Cogdf::fast_multipole_embedder::FMEKernel
 Cogdf::fast_multipole_embedder::FMELocalContextLocal thread Context
 Cogdf::fast_multipole_embedder::FMENodeChainPartition
 Cogdf::fast_multipole_embedder::FMETaskThe thread task class used only as an interface
 Cogdf::fast_multipole_embedder::FMEThreadThe fast multipole embedder work thread class
 Cogdf::fast_multipole_embedder::FMEThreadPool
 Cogdf::fast_multipole_embedder::FMETreePartitionStruct for distributing subtrees to the threads
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, ArgType2, ArgType3, ArgType4, ArgType5, ArgType6, ArgType7, ArgType8 >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, ArgType2, ArgType3, ArgType4, ArgType5, ArgType6, ArgType7, EmptyArgType >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, ArgType2, ArgType3, ArgType4, ArgType5, ArgType6, EmptyArgType, EmptyArgType >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, ArgType2, ArgType3, ArgType4, ArgType5, EmptyArgType, EmptyArgType, EmptyArgType >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, ArgType2, ArgType3, ArgType4, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, ArgType2, ArgType3, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, ArgType2, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, ArgType1, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType >
 Cogdf::fast_multipole_embedder::FuncInvoker< FunctionType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType, EmptyArgType >
 Cogdf::fast_multipole_embedder::GalaxyMultilevel
 Cogdf::fast_multipole_embedder::GalaxyMultilevel::LevelEdgeInfo
 Cogdf::fast_multipole_embedder::GalaxyMultilevel::LevelNodeInfo
 Cogdf::fast_multipole_embedder::GalaxyMultilevelBuilder
 Cogdf::fast_multipole_embedder::GalaxyMultilevelBuilder::LevelNodeState
 Cogdf::fast_multipole_embedder::GalaxyMultilevelBuilder::NodeOrderInfo
 Cogdf::fast_multipole_embedder::if_then_else_functor< CondType, ThenType, ElseType >Functor for conditional usage of a functor
 Cogdf::fast_multipole_embedder::l2l_functorLocal-to-Local functor
 Cogdf::fast_multipole_embedder::l2p_functorLocal-to-Point functor
 Cogdf::fast_multipole_embedder::LinearQuadtree
 Cogdf::fast_multipole_embedder::LinearQuadtree::bottom_up_traversal_functor< F, CondType >Bottom up traversal of the subtree of a given node
 Cogdf::fast_multipole_embedder::LinearQuadtree::forall_children_functor< F >Simple functor for iterating over all children of a node
 Cogdf::fast_multipole_embedder::LinearQuadtree::forall_ordered_pairs_of_children_functor< F >Functor for iterating over all ordered pairs of children of a node
 Cogdf::fast_multipole_embedder::LinearQuadtree::forall_points_functor< Func >Simple functor for iterating over all points of a node
 Cogdf::fast_multipole_embedder::LinearQuadtree::forall_tree_nodes_functor< F >Simple functor for iterating over all nodes
 Cogdf::fast_multipole_embedder::LinearQuadtree::is_fence_condition_functor
 Cogdf::fast_multipole_embedder::LinearQuadtree::is_leaf_condition_functor
 Cogdf::fast_multipole_embedder::LinearQuadtree::LQNode
 Cogdf::fast_multipole_embedder::LinearQuadtree::LQPoint
 Cogdf::fast_multipole_embedder::LinearQuadtree::LQWSPair
 Cogdf::fast_multipole_embedder::LinearQuadtree::StoreDirectNodeFunctor
 Cogdf::fast_multipole_embedder::LinearQuadtree::StoreDirectPairFunctor
 Cogdf::fast_multipole_embedder::LinearQuadtree::StoreWSPairFunctor
 Cogdf::fast_multipole_embedder::LinearQuadtree::top_down_traversal_functor< F, CondType >Top down traversal of the subtree of a given node
 Cogdf::fast_multipole_embedder::LinearQuadtree::wspd_functor< WSPairFuncType, DPairFuncType, DNodeFuncType, BranchCondType >
 Cogdf::fast_multipole_embedder::LinearQuadtreeBuilderBuilder for the LinearQuadtree
 Cogdf::fast_multipole_embedder::LinearQuadtreeExpansion
 Cogdf::fast_multipole_embedder::LQCoordsFunctorComputes the coords and size of the i-th node in the LinearQuadtree
 Cogdf::fast_multipole_embedder::LQMortonFunctor
 Cogdf::fast_multipole_embedder::LQPartitionerThe partitioner which partitions the quadtree into subtrees and partitions the sequence of inner nodes and leaves
 Cogdf::fast_multipole_embedder::LQPointUpdateFunctor
 Cogdf::fast_multipole_embedder::m2l_functorMultipole-to-Local functor
 Cogdf::fast_multipole_embedder::M2LFunctorConverts the multipole expansion coefficients from all nodes which are well separated from the i-th node to local expansion coefficients and adds them to the local expansion coefficients of the i-th node
 Cogdf::fast_multipole_embedder::m2m_functorMultipole-to-Multipole functor
 Cogdf::fast_multipole_embedder::min_max_functor< T >Generic min max functor for an array
 Cogdf::fast_multipole_embedder::NDFunctorCalculates the repulsive forces acting between all nodes inside the cell of the i-th LinearQuadtree node
 Cogdf::fast_multipole_embedder::NodeAdjInfoInformation about incident edges (16 bytes)
 Cogdf::fast_multipole_embedder::NodeMassComparer
 Cogdf::fast_multipole_embedder::NodeMoveFunctor< FLAGS >
 Cogdf::fast_multipole_embedder::not_condition_functor< Func >Functor for negating a condition
 Cogdf::fast_multipole_embedder::p2m_functorPoint-to-Multipole functor
 Cogdf::fast_multipole_embedder::p2p_functorLocal-to-Point functor
 Cogdf::fast_multipole_embedder::pair_call_functor< F, A >Helper functor to generate a pair as parameters
 Cogdf::fast_multipole_embedder::pair_vice_versa_functor< Func >Functor for invoking a functor for a pair(u,v) and then (v,u)
 Cogdf::fast_multipole_embedder::RandomNodeSetUtility class to select multiple nodes randomly
 Cogdf::fast_multipole_embedder::WSPDClass for the Well-Separated-Pairs-Decomposition (WSPD)
 Cogdf::FibonacciHeapNode< T >Fibonacci heap node
 Cogdf::FillProperties of fills
 Cogdf::FindKuratowskisThis class collects information about Kuratowski Subdivisions which is used for extraction later
 Cogdf::FlowCompactionCompaction algorithm using min-cost flow in the dual of the constraint graph
 Cogdf::FMMMOptions
 Cogdf::gdf::Parser
 Cogdf::GenericComparer< ELEM, NUM, ascending >Compare elements based on a single comparable attribute
 Cogdf::GenericLine< PointType >Infinite lines
 Cogdf::GenericPoint< T >Parameterized base class for points
 Cogdf::gexf::Parser
 Cogdf::GF2Solver
 Cogdf::GF2Solver::ChunkBase< Dim, Next >
 Cogdf::GF2Solver::Equation
 Cogdf::GF2Solver::Matrix
 Cogdf::GF2Solver::Row2
 Cogdf::GlueMap< Cost >This is a helper class to make the glueing of two edges simpler
 Cogdf::GmlObjectRepresents node in GML parse tree
 Cogdf::GmlParserReads GML file and constructs GML parse tree
 Cogdf::GraphData type for general directed graphs (adjacency list representation)
 Cogdf::Graph::CCsInfoInfo structure for maintaining connected components
 Cogdf::Graph::HiddenEdgeSetFunctionality for temporarily hiding edges in constant time
 Cogdf::GraphAttributesStores additional attributes of a graph (like layout information)
 Cogdf::GraphCopyAttributesHelper class for accessing graph attributes from a copy of the graph
 Cogdf::GraphIOUtility class providing graph I/O in various exchange formats
 Cogdf::GraphIO::SVGSettingsCondensed settings for drawing SVGs
 Cogdf::GraphMLParser
 Cogdf::GraphObserverAbstract Base class for graph observers
 Cogdf::GridLayoutRepresentation of a graph's grid layout
 Cogdf::HananiTutteCPlanarityC-planarity testing via Hanani-Tutte approach
 Cogdf::HashConstIterator< K, I, H >Iterators for hash tables
 Cogdf::HashElementBaseBase class for elements within a hash table
 Cogdf::HashFuncTuple< K1_, K2_, Hash1_, Hash2_ >
 Cogdf::HashingBaseBase class for hashing with chaining and table doubling
 Cogdf::HeapBase< IMPL, H, T, C >Common interface for all heap classes
 Cogdf::HierarchyRepresentation of proper hierarchies used by Sugiyama-layout
 Cogdf::HierarchyClusterLayoutModuleInterface of hierarchy layout algorithms for cluster graphs
 Cogdf::HierarchyLayoutModuleInterface of hierarchy layout algorithms
 Cogdf::HierarchyLevelsBase
 Cogdf::HotQueue< V, P, H >Heap-on-Top queue implementation
 Cogdf::HotQueue< V, P, H >::HeapComparatorComparator used by underlying heap
 Cogdf::HotQueueHandle< V, P, HeapHandle >Heap-on-Top handle to inserted items
 Cogdf::HotQueueNode< V, P >Heap-on-Top bucket element
 Cogdf::Hypergraph
 Cogdf::HypergraphArrayBaseAbstract base class for hypergraph arrays
 Cogdf::HypergraphAttributesStores additional attributes of a hypergraph
 Cogdf::HypergraphLayoutModuleInterface of hypergraph layout algorithms
 Cogdf::HypergraphObserver
 Cogdf::IncNodeInserter
 Cogdf::InitializationThe class Initialization is used for initializing global variables
 Cogdf::InitialPlacerBase class for placer modules
 Cogdf::InOutPointRepresentation of an in- or outpoint
 Cogdf::internal::FaceAdjContainerContainer for the adjacency entries in a face
 Cogdf::internal::FaceAdjIteratorForward iterator for adjacency entries in a face
 Cogdf::internal::GraphArrayIteratorBase< ArrayType, isConst >
 Cogdf::internal::GraphElementThe base class for objects used by (hyper)graphs
 Cogdf::internal::GraphIteratorBase< GraphObjectPtr, isReverse >
 Cogdf::internal::GraphListBaseBase class for GraphElement lists
 Cogdf::IOPointsRepresentation of in- and outpoint lists
 Cogdf::KuratowskiStructureA Kuratowski Structure is a special graph structure containing severals subdivisions
 Cogdf::KuratowskiWrapperWrapper-class for Kuratowski Subdivisions containing the minortype and edgelist
 Cogdf::LayeredCrossMinModuleInterface of crossing minimization algorithms for layered graphs
 Cogdf::LayoutStores a layout of a graph (coordinates of nodes, bend points of edges)
 Cogdf::LayoutClusterPlanRepModuleInterface for planar cluster layout algorithms
 Cogdf::LayoutModuleInterface of general layout algorithms
 Cogdf::LayoutPlanRepModuleInterface for planar layout algorithms (used in the planarization approach)
 Cogdf::LayoutPlanRepUMLModuleInterface for planar UML layout algorithms
 Cogdf::LayoutStandardsStandard values for graphical attributes and layouts
 Cogdf::LayoutStatisticsComputes statistical information about a layout
 Cogdf::LCAImplements the <O(n log n), O(1)>-time "sparse table" algorithm by Bender and Farach-Colton to compute lowest common ancestors (LCAs) in arborescences (not arbitrary directed acyclic graphs)
 Cogdf::LeftistOrdering
 Cogdf::LeftistOrdering::Candidate
 Cogdf::LeftistOrdering::Partitioning
 Cogdf::LevelBaseRepresentation of levels in hierarchies
 Cogdf::LHTreeNode
 Cogdf::LHTreeNode::Adjacency
 Cogdf::LHTreeNode::ClusterCrossing
 Cogdf::ListElement< E >Structure for elements of doubly linked lists
 Cogdf::ListIteratorBase< E, isConst, isReverse >Encapsulates a pointer to a list element
 Cogdf::ListPure< E >Doubly linked lists
 Cogdf::LoggerCentralized global and local logging facility working on streams like std::cout
 Cogdf::LongestPathCompactionCompaction algorithm using longest paths in the constraint graph
 Cogdf::LPSolver
 Cogdf::MallocMemoryAllocatorImplements a simple memory manager using malloc() and free()
 Cogdf::MallocMemoryAllocator::MemElem
 Cogdf::MaxAdjOrderingCalculate one or all Maximum Adjacency Ordering(s) of a given simple undirected graph
 Cogdf::MaxFlowModule< T >
 Cogdf::MinCostFlowModule< TCost >Interface for min-cost flow algorithms
 Cogdf::MinCostFlowReinelt< TCost >::arctype
 Cogdf::MinCostFlowReinelt< TCost >::nodetype
 Cogdf::MinCutComputes a minimum cut in a graph
 Cogdf::MinimumEdgeDistances< ATYPE >Maintains input sizes for improvement compaction (deltas and epsilons)
 Cogdf::MinimumEdgeDistances< ATYPE >::InfoType
 Cogdf::MinSTCutModule< TCost >
 Cogdf::MinSteinerTreeGoemans139< T >::MainClass managing LP-based approximation
 Cogdf::MinSteinerTreeMehlhorn< T >::MehlhornTripleRepresents a triple as specified in the algorithms description (see paper)
 Cogdf::MinSteinerTreeModule< T >Serves as an interface for various methods to compute or approximate minimum Steiner trees on undirected graphs with edge costs
 Cogdf::MixedModelBase
 Cogdf::MixedModelCrossingsBeautifierModuleThe base class for Mixed-Model crossings beautifier algorithms
 Cogdf::MMOrder
 Cogdf::MMVariableEmbeddingInserter::AnchorNodeInfo
 Cogdf::MMVariableEmbeddingInserter::Paths
 Cogdf::ModifiedNibbleClustererThe modified nibble clustering algorithm
 Cogdf::ModuleBase class for modules
 Cogdf::MultiEdgeApproxInserter::VertexBlock
 Cogdf::MultilevelBuilderBase class for merger modules
 Cogdf::MultilevelGraph
 Cogdf::NearestRectangleFinderFinds in a given set of rectangles for each point in a given set of points the nearest rectangle
 Cogdf::NearestRectangleFinder::PairRectDistRepresents a rectangle (given by its index) and a distance value
 Cogdf::NearestRectangleFinder::RectRegionRepresents a rectangle given by center point, width and height
 Cogdf::NodeArrayBaseAbstract base class for node arrays
 Cogdf::NodeMerge
 Cogdf::NodePair
 Cogdf::NodeSet< SupportFastSizeQuery >Node sets
 Cogdf::NonPlanarCore< TCost >Non-planar core reduction
 Cogdf::NonPlanarCore< TCost >::CutEdgeStruct to represent an edge that needs to be crossed in order to cross an st-component
 Cogdf::OrderComparer
 Cogdf::OrthoRepOrthogonal representation of an embedded graph
 Cogdf::OrthoRep::SideInfoUMLInformation about a side of a vertex in UML diagrams
 Cogdf::OrthoRep::VertexInfoUMLFurther information about the cages of vertices in UML diagrams
 Cogdf::OrthoShaper
 Cogdf::PairingHeapNode< T >Pairing heap node
 Cogdf::PALabelAuxiliary class for the planar augmentation algorithm
 Cogdf::PertinentGraphPertinent graphs of nodes in an SPQR-tree
 Cogdf::PlanarityModuleModule for planarity testing and planar embeddings
 Cogdf::planarization_layout::CliqueReplacer
 Cogdf::PlanarSubgraphCactus< TCost >::AdjEntryComparer
 Cogdf::PlanarSubgraphCactus< TCost >::EdgeComparer
 Cogdf::PlanarSubgraphFast< TCost >::ThreadMaster
 Cogdf::PlanarSubgraphFast< TCost >::Worker
 Cogdf::PlanRep::Deg1RestoreInfoInformation for restoring degree-1 nodes
 Cogdf::PlanRepExpansion::Crossing
 Cogdf::PlanRepExpansion::NodeSplitRepresentation of a node split in a planarized expansion
 Cogdf::PoolMemoryAllocatorAllocates memory in large chunks for better runtime
 Cogdf::PoolMemoryAllocator::MemElemBasic memory element used to realize a linked list of deallocated memory segments
 Cogdf::pq_internal::Compare< T, C >Used to compare elements with assigned priorities
 Cogdf::pq_internal::PairTemplate< E, P >Pair for storing an element and a priority
 Cogdf::PQBasicKeyRootThe class PQBasicKeyRoot is used as a base class of the class template basicKey
 Cogdf::PQNodeRootThe class PQNodeRoot is used as a base class of the class PQNode
 Cogdf::PQTree< T, X, Y >
 Cogdf::PreprocessorLayout::EdgeDataDeleted Edges are stored in EdgeData
 Cogdf::Prioritized< X, Priority >Augments any data elements of type X with keys of type Priority. This class is also its own Comparer
 Cogdf::PriorityQueue< T, C, Impl >Priority queue interface wrapper for heaps
 Cogdf::ProcrustesPointSet
 Cogdf::QueueEntry
 Cogdf::RadialTreeLayout::Group
 Cogdf::RadixHeap< V, P >Radix heap data structure implementation
 Cogdf::RadixHeapNode< V, P >
 Cogdf::RankingModuleInterface of algorithms for computing a node ranking
 Cogdf::RCCrossings
 Cogdf::Reverse< T >A wrapper class to easily iterate through a container in reverse
 Cogdf::RMHeapNode< T >Randomized meldable heap node
 Cogdf::RoutingChannel< ATYPE >Maintains input sizes for constructive compaction (size of routing channels, separation, cOverhang)
 Cogdf::RoutingChannel< ATYPE >::vInfo
 Cogdf::ShellingOrderThe shelling order of a graph
 Cogdf::ShellingOrderModuleBase class for modules that compute a shelling order of a graph
 Cogdf::ShortestPathModule
 Cogdf::SimDrawThe Base class for simultaneous graph drawing
 Cogdf::SimDrawColorizer::SimDrawColorSchemeManages the various color schemes
 Cogdf::SimDrawManipulatorModuleInterface for simdraw manipulators
 Cogdf::SimpleCluster
 Cogdf::SkeletonSkeleton graphs of nodes in an SPQR-tree
 Cogdf::Skiplist< X >A randomized skiplist
 Cogdf::Skiplist< X >::ElementInternal structure to hold the items and internal forward pointers of the skiplist
 Cogdf::SkiplistIterator< X >Forward-Iterator for Skiplists
 Cogdf::SListElement< E >Structure for elements of singly linked lists
 Cogdf::SListIteratorBase< E, isConst >Encapsulates a pointer to an ogdf::SList element
 Cogdf::SListPure< E >Singly linked lists
 Cogdf::SolarMerger::PathData
 Cogdf::SortedSequence< KEY, INFO, CMP >Maintains a sequence of (key,info) pairs sorted by key
 Cogdf::SortedSequence< KEY, INFO, CMP >::ElementInternal structure to hold the items and internal forward/backward pointers of the skiplist
 Cogdf::SortedSequenceIteratorBase< KEY, INFO, CMP, isConst, isReverse >Iterators for sorted sequences
 Cogdf::SPQRTreeLinear-time implementation of static SPQR-trees
 Cogdf::spring_embedder::CommonForceModelBase< NodeInfo >
 Cogdf::spring_embedder::MasterBase< NodeInfo, ForceModelBase >Base class for ogdf::SpringEmbedderGridVariant::Master
 Cogdf::spring_embedder::WorkerBase< Master, NodeInfo >Base class for ogdf::SpringEmbedderGridVariant::Worker
 Cogdf::SpringEmbedderFRExact::ArrayGraph
 Cogdf::SpringEmbedderGridVariant::NodeInfo
 Cogdf::sse::ComplexDoubleClass to generate instrinsics for complex number arithmetic functions
 Cogdf::StdComparer< E >Standard comparer (valid as a static comparer)
 Cogdf::StdComparer< bool >Generates a specialization of the standard static comparer for booleans
 Cogdf::StdComparer< Prioritized< X, Priority > >
 Cogdf::steiner_tree::Full2ComponentGenerator< T >Trivial full 2-component generation by lookups of shortest paths between terminal pairs
 Cogdf::steiner_tree::Full3ComponentGeneratorModule< T >Interface for full 3-component generation including auxiliary functions
 Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagner< T >A generator for restricted full components (for Steiner tree approximations) based on the Dreyfus-Wagner algorithm
 Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagner< T >::DWMData
 Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagner< T >::SortedNodeListHashFunc
 Cogdf::steiner_tree::FullComponentStore< T, ExtraDataType >A data structure to store full components
 Cogdf::steiner_tree::FullComponentStore< T, ExtraDataType >::Metadata< Y, Enable >
 Cogdf::steiner_tree::FullComponentStore< T, ExtraDataType >::Metadata< Y, typename std::enable_if<!std::is_void< Y >::value >::type >
 Cogdf::steiner_tree::goemans::Approximation< T >The actual 1.39-approximation algorithm by Goemans et al. with a set of terminalized nodes as result
 Cogdf::steiner_tree::goemans::BlowupComponents< T >Obtain and provides information about components in a given blowup graph
 Cogdf::steiner_tree::goemans::BlowupGraph< T >A special-purpose blowup graph for gammoid computation: directed, with special source and target, with core edges (implemented as nodes)
 Cogdf::steiner_tree::goemans::CoreEdgeModule< T >Interface for core edge finder algorithms
 Cogdf::steiner_tree::LossMetadata< T >
 Cogdf::steiner_tree::LPRelaxationSER< T >Class managing the component-based subtour elimination LP relaxation for the Steiner tree problem and its solving
 Cogdf::steiner_tree::Save< T >This class serves as an interface for different approaches concerning the calculation of save edges
 Cogdf::steiner_tree::Triple< T >This class represents a triple used by various contraction-based minimum Steiner tree approximations
 Cogdf::steiner_tree::UnorderedNodePairEqualityA class used by the unordered_maps inside the reductions
 Cogdf::steiner_tree::UnorderedNodePairHasherA class used by the unordered_maps inside the reductions
 Cogdf::SteinerTreePreprocessing< T >This class implements preprocessing strategies for the Steiner tree problem
 Cogdf::SteinerTreePreprocessing< T >::HeavyPathDecomposition
 Cogdf::StlGreater< TYPE, COMPARER >Template for converting any StdComparer into a STL compatible compare functor
 Cogdf::StlLess< TYPE, COMPARER >Template for converting any StdComparer into a STL compatible compare functor
 Cogdf::StopwatchRealizes a stopwatch for measuring elapsed time
 Cogdf::StrokeProperties of strokes
 Cogdf::SubsetEnumerator< T >Enumerator for k-subsets of a given type
 Cogdf::SvgPrinterSVG Writer
 Cogdf::SystemSystem specific functionality
 Cogdf::TargetComparer< CONTENTTYPE, STATICCONTENTCOMPARER >A static comparer which compares the target of pointers ("content"), instead of the pointer's adresses
 Cogdf::TileToRowsCCPacker::RowInfo< POINT >
 Cogdf::TimeouterClass for timeout funtionality
 Cogdf::tlp::Lexer
 Cogdf::tlp::Parser
 Cogdf::tlp::Token
 Cogdf::TokenIgnorer
 Cogdf::topology_module::EdgeLegHelper class for the computation of crossings
 Cogdf::TopologyModuleConstructs embeddings from given layout
 Cogdf::TriconnectivityRealizes Hopcroft/Tarjan algorithm for finding the triconnected components of a biconnected multi-graph
 Cogdf::Triconnectivity::CompStructRepresentation of a component
 Cogdf::Tuple2< E1, E2 >Tuples of two elements (2-tuples)
 Cogdf::UmlDiagramGraphContains the class UmlDiagramGraph which represents one particular diagram of the complete UML Model
 Cogdf::UMLGraph::AssociationClassModelling of association classes
 Cogdf::UMLLayoutModuleInterface of UML layout algorithms
 Cogdf::UPRLayoutModuleInterface of hierarchy layout algorithms
 Cogdf::UpSAT
 Cogdf::UpwardPlanarityUpward planarity testing and embedding
 Cogdf::UpwardPlanarityEmbeddedDigraph
 Cogdf::UpwardPlanaritySingleSourcePerforms upward planarity testing and embedding for single-source digraphs
 Cogdf::UpwardPlanaritySingleSource::DegreeInfo
 Cogdf::UpwardPlanarSubgraphModuleInterface for algorithms for computing an upward planar subgraph
 Cogdf::VComparer< E >Abstract base class for comparer classes
 Cogdf::VisibilityLayout::EdgeSegment
 Cogdf::VisibilityLayout::NodeSegment
 Cogdf::Voronoi< T >Computes Voronoi regions in an edge-weighted graph
 Cogdf::WeightComparer< T >
 Cogdf::whaInfo
 Cogdf::WInfoSaves information about a pertinent node w between two stopping vertices
 Cogdf::PQTree< edge, IndInfo *, bool >
 Cogdf::PQTree< edge, whaInfo *, bool >
 Cogdf::PQTree< T, whaInfo *, Y >
 Cogdf::Prioritized< X *, Priority >
 Cpugi::xml_attribute
 Cpugi::xml_attribute_iterator
 Cpugi::xml_named_node_iterator
 Cpugi::xml_node
 Cpugi::xml_node_iterator
 Cpugi::xml_object_range< It >
 Cpugi::xml_parse_result
 Cpugi::xml_text
 Cpugi::xml_tree_walker
 Cpugi::xml_writer
 Cpugi::xpath_node
 Cpugi::xpath_node_set
 Cpugi::xpath_parse_result
 Cpugi::xpath_query
 Cpugi::xpath_variable
 Cpugi::xpath_variable_set
 CMinisat::Internal::Queue< CRef >
 CMinisat::Internal::RegionAllocator< uint32_t >
 Cogdf::RoutingChannel< int >
 Cogdf::SListElement< abacus::PoolSlot< abacus::Constraint, abacus::Variable > *>
 Cogdf::SListElement< abacus::PoolSlot< abacus::Variable, abacus::Constraint > *>
 Cogdf::SListElement< abacus::PoolSlot< BaseType, CoType > *>
 Cogdf::SListElement< double >
 Cogdf::SListElement< int >
 Cogdf::SListElement< ogdf::AdjElement >
 Cogdf::SListElement< ogdf::ArrayBuffer< ogdf::AdjElement > >
 Cogdf::SListElement< ogdf::booth_lueker::PlanarLeafKey >
 Cogdf::SListElement< ogdf::ClusterElement >
 Cogdf::SListElement< ogdf::EdgeElement >
 Cogdf::SListElement< ogdf::ExternE >
 Cogdf::SListElement< ogdf::KuratowskiStructure >
 Cogdf::SListElement< ogdf::MultiEdgeApproxInserter::VertexBlock >
 Cogdf::SListElement< ogdf::NodeElement >
 Cogdf::SListElement< ogdf::PQNode< edge, ogdf::whaInfo *, bool > *>
 Cogdf::SListElement< ogdf::PQNode< T, ogdf::whaInfo *, Y > *>
 Cogdf::SListElement< ogdf::SimpleCluster *>
 Cogdf::SListElement< ogdf::SListPure< ogdf::EdgeElement > >
 Cogdf::SListElement< ogdf::Tuple2< ogdf::NodeElement, int > >
 Cogdf::SListElement< ogdf::UMLGraph::AssociationClass *>
 Cogdf::SListElement< ogdf::WInfo >
 Cogdf::SListIteratorBase< ogdf::ExternE >
 Cogdf::SListPure< abacus::PoolSlot< abacus::Constraint, abacus::Variable > *>
 Cogdf::SListPure< abacus::PoolSlot< abacus::Variable, abacus::Constraint > *>
 Cogdf::SListPure< abacus::PoolSlot< BaseType, CoType > *>
 Cogdf::SListPure< double >
 Cogdf::SListPure< int >
 Cogdf::SListPure< ogdf::AdjElement >
 Cogdf::SListPure< ogdf::ArrayBuffer< ogdf::AdjElement > >
 Cogdf::SListPure< ogdf::booth_lueker::PlanarLeafKey >
 Cogdf::SListPure< ogdf::ClusterElement >
 Cogdf::SListPure< ogdf::EdgeElement >
 Cogdf::SListPure< ogdf::ExternE >
 Cogdf::SListPure< ogdf::KuratowskiStructure >
 Cogdf::SListPure< ogdf::MultiEdgeApproxInserter::VertexBlock >
 Cogdf::SListPure< ogdf::NodeElement >
 Cogdf::SListPure< ogdf::PQNode< edge, ogdf::whaInfo *, bool > *>
 Cogdf::SListPure< ogdf::PQNode< T, ogdf::whaInfo *, Y > *>
 Cogdf::SListPure< ogdf::SimpleCluster * >
 Cogdf::SListPure< ogdf::SListPure< ogdf::EdgeElement > >
 Cogdf::SListPure< ogdf::Tuple2< ogdf::NodeElement, int > >
 Cogdf::SListPure< ogdf::UMLGraph::AssociationClass *>
 Cogdf::SListPure< ogdf::WInfo >
 Cbackward::StackTraceImpl< system_tag::current_tag >
 Cthread
 Cogdf::SubsetEnumerator< ogdf::NodeElement >
 Cbackward::TraceResolverImpl< system_tag::current_tag >
 Cogdf::Tuple2< I1_, I2_ >
 Cogdf::Tuple2< node, int >
 Cogdf::Tuple2< ogdf::NodeElement, int >
 Cogdf::VComparer< adjEntry >
 CMinisat::Internal::vec< char >
 CMinisat::Internal::vec< CRef >
 CMinisat::Internal::vec< double >
 CMinisat::Internal::vec< Idx >
 CMinisat::Internal::vec< int >
 CMinisat::Internal::vec< Minisat::Internal::lbool >
 CMinisat::Internal::vec< Minisat::Internal::Lit >
 CMinisat::Internal::vec< Minisat::Internal::Map::Pair >
 CMinisat::Internal::vec< Minisat::Internal::Solver::VarData >
 CMinisat::Internal::vec< Minisat::Internal::vec< CRef > >
 CMinisat::Internal::vec< Minisat::Internal::vec< Minisat::Internal::Solver::Watcher > >
 CMinisat::Internal::vec< uint32_t >
 CMinisat::Internal::vec< Var >
 CMinisat::Internal::vec< Vec >
 CBaseEmbedder