| Cabacus::AbaBHeap< Type, Key > | Binary heaps |
| ►Cabacus::AbacusRoot | Base class of all other classes of ABACUS |
| ►Cabacus::AbacusGlobal | Global data and functions |
| ►Cabacus::Master | The master of the optimization |
| ►Cogdf::cluster_planarity::CP_MasterBase | |
| Cogdf::cluster_planarity::CPlanarityMaster | |
| Cogdf::cluster_planarity::MaxCPlanarMaster | |
| Cogdf::MinSteinerTreeDirectedCut< T >::Master | Master problem of Steiner tree branch&cut algorithm |
| Cabacus::AbaPrioQueue< Type, Key > | Bounded priority queues |
| ►Cabacus::BranchRule | Abstract base class for all branching rules |
| Cabacus::BoundBranchRule | Implements a branching rule for modifying the lower and the upper bound of a variable |
| Cabacus::ConBranchRule | Implements the branching by adding a constraint to the set of active constraints |
| Cabacus::SetBranchRule | Implements a branching rule for setting a binary variable to its lower or upper bound |
| Cabacus::ValBranchRule | Implements a branching rule for setting a variable to a certain value |
| Cabacus::ConClass | Constraint classification |
| ►Cabacus::ConVar | Common base class for constraints (Constraint) and variables (Variable) |
| ►Cabacus::Constraint | Forms the virtual base class for all possible constraints given in pool format |
| Cabacus::NumCon | Constraints defined by a number |
| ►Cabacus::RowCon | Implements constraints stored in the class Row |
| Cabacus::SRowCon | Constraints using row with static variable set |
| ►Cogdf::cluster_planarity::BaseConstraint | Basic constraint type |
| Cogdf::cluster_planarity::ChunkConnection | |
| Cogdf::cluster_planarity::CutConstraint | |
| Cogdf::cluster_planarity::ClusterKuratowskiConstraint | |
| Cogdf::cluster_planarity::MaxPlanarEdgesConstraint | |
| Cogdf::cluster_planarity::MinimalClusterConnection | |
| Cogdf::MinSteinerTreeDirectedCut< T >::DegreeConstraint | Constraint for nodes, e.g., in/outdegree stuff |
| Cogdf::MinSteinerTreeDirectedCut< T >::DegreeEdgeConstraint | Constraint for relating the indegree and one outgoing edge of a node |
| Cogdf::MinSteinerTreeDirectedCut< T >::DirectedCutConstraint | Class for directed cuts (i.e., separated Steiner cuts) |
| Cogdf::MinSteinerTreeDirectedCut< T >::EdgeConstraint | Constraint for edges, e.g., subtour elimination constraints of size 2 ((G)SEC2) |
| ►Cabacus::Variable | Forms the virtual base class for all possible variables given in pool format |
| Cabacus::ColVar | Some optimization problems, in particular column generation problems, are better described from a variable point of view instead of a constraint point of view |
| Cabacus::NumVar | Variables identified by a number |
| ►Cogdf::cluster_planarity::EdgeVar | |
| Cogdf::cluster_planarity::CPlanarEdgeVar | |
| Cogdf::MinSteinerTreeDirectedCut< T >::EdgeVariable | Variable for directed edges |
| Cabacus::CSense | Sense of constraints |
| Cabacus::FixCand | Candidates for fixing |
| Cabacus::FSVarStat | Status of fixed and set variables |
| Cabacus::History | Solution histories |
| Cabacus::InfeasCon | Infeasible constraints |
| ►Cabacus::LP | Linear programs |
| ►Cabacus::LpSub | The linear program of a subproblem |
| Cabacus::LpSubOsi | |
| ►Cabacus::OsiIF | |
| Cabacus::LpSubOsi | |
| ►Cabacus::LpMaster | The LP master |
| Cabacus::LpMasterOsi | The OSI LP master |
| Cabacus::LPVARSTAT | Status of variables |
| Cabacus::OpenSub | Maintains open subproblems |
| Cabacus::OptSense | Sense of optimization |
| Cabacus::Pool< BaseType, CoType > | Base class for constraint/variabe pools |
| Cabacus::SlackStat | Status of slack variables |
| ►Cabacus::SparVec | Sparse vectors |
| Cabacus::Column | Representation of variables in column format |
| Cabacus::Row | Representation of constraints in the row format |
| ►Cabacus::Sub | The subproblem |
| Cogdf::cluster_planarity::CPlanaritySub | |
| Cogdf::cluster_planarity::MaxCPlanarSub | |
| Cogdf::MinSteinerTreeDirectedCut< T >::Sub | Subproblem of Steiner tree algorithm |
| Cabacus::TailOff | Tailing off manager |
| Cabacus::VarType | Variable types |
| Cabacus::Pool< abacus::Constraint, abacus::Variable > | |
| Cabacus::Pool< abacus::Variable, abacus::Constraint > | |
| Cabacus::Pool< CoType, BaseType > | |
| Cabacus::AbaHash< KeyType, ItemType > | Hash tables |
| Cabacus::AbaHashItem< KeyType, ItemType > | Items in hash tables |
| Cabacus::AbaRing< Type > | Bounded circular lists |
| Cabacus::Active< BaseType, CoType > | Implements the sets of active constraints and variables which are associated with each subproblem |
| Cabacus::CutBuffer< BaseType, CoType > | Cut buffers |
| Cabacus::LpSolution< BaseType, CoType > | LP solutions |
| Cabacus::PoolSlot< BaseType, CoType > | Stores constraints and variables |
| Cabacus::PoolSlotRef< BaseType, CoType > | Stores a pointer to a pool slot with version number |
| Cabacus::Separator< BaseType, CoType > | Separators |
| ►Cabacus::StandardPool< BaseType, CoType > | Standard pools |
| Cabacus::NonDuplPool< BaseType, CoType > | Standard pools without constraint duplication |
| Cabacus::AbaHash< string, string > | |
| Cabacus::AbaHash< unsigned, abacus::PoolSlot< abacus::Constraint, abacus::Variable > * > | |
| Cabacus::AbaHash< unsigned, abacus::PoolSlot< BaseType, CoType > * > | |
| Cabacus::AbaHash< unsigned, BaseType * > | |
| Cabacus::AbaHashItem< string, string > | |
| Cabacus::AbaHashItem< unsigned, abacus::PoolSlot< abacus::Constraint, abacus::Variable > * > | |
| Cabacus::AbaHashItem< unsigned, abacus::PoolSlot< BaseType, CoType > * > | |
| Cabacus::AbaHashItem< unsigned, BaseType * > | |
| Cabacus::AbaRing< double > | |
| Cabacus::Active< abacus::Constraint, abacus::Variable > | |
| Cabacus::Active< abacus::Variable, abacus::Constraint > | |
| Cabacus::Active< CoType, BaseType > | |
| Cogdf::Array2D< bool > | |
| Cogdf::Array2D< double > | |
| Cogdf::Array2D< int > | |
| Cogdf::Array2D< ogdf::EdgeElement > | |
| Cogdf::Array2D< ogdf::ListPure< int > > | |
| Cogdf::Array< abacus::FSVarStat * > | |
| 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 > * > | |
| Cogdf::Array< abacus::PoolSlotRef< BaseType, CoType > * > | |
| Cogdf::Array< abacus::PoolSlotRef< CoType, BaseType > * > | |
| Cogdf::Array< abacus::SlackStat * > | |
| Cogdf::Array< BlockType > | |
| Cogdf::Array< bool > | |
| Cogdf::Array< double > | |
| Cogdf::Array< Index > | |
| Cogdf::Array< int > | |
| Cogdf::Array< int64_t > | |
| Cogdf::Array< Key > | |
| ►Cogdf::Array< List< edge > > | |
| Cogdf::KuratowskiSubdivision | |
| ►Cogdf::Array< node > | |
| Cogdf::ShellingOrderSet | The node set in a shelling order of a graph |
| Cogdf::Array< NodeInfo > | |
| Cogdf::Array< ogdf::Array< ogdf::AdjElement > > | |
| Cogdf::Array< ogdf::ArrayLevel * > | |
| Cogdf::Array< ogdf::Block * > | |
| Cogdf::Array< ogdf::EdgeElement > | |
| Cogdf::Array< ogdf::ENGLayer > | |
| Cogdf::Array< ogdf::GenericPoint > | |
| Cogdf::Array< ogdf::GF2Solver::Equation * > | |
| Cogdf::Array< ogdf::Level * > | |
| Cogdf::Array< ogdf::LHTreeNode * > | |
| Cogdf::Array< ogdf::List< ogdf::EdgeElement > * > | |
| 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::InOutPoint > > | |
| Cogdf::Array< ogdf::ListPure< ogdf::NodeElement > > | |
| Cogdf::Array< ogdf::MinCostFlowReinelt::arctype > | |
| Cogdf::Array< ogdf::MinCostFlowReinelt::nodetype > | |
| Cogdf::Array< ogdf::MMVariableEmbeddingInserter::AnchorNodeInfo > | |
| Cogdf::Array< ogdf::NodeElement > | |
| Cogdf::Array< ogdf::planar_separators::Ring, int > | |
| Cogdf::Array< ogdf::ShellingOrderSet > | |
| Cogdf::Array< ogdf::SList< ogdf::AdjElement > > | |
| Cogdf::Array< ogdf::SList< ogdf::EdgeElement > > | |
| Cogdf::Array< ogdf::SList< ogdf::NodeElement > > | |
| Cogdf::Array< ogdf::SListPure< ogdf::EdgeElement > > | |
| Cogdf::Array< ogdf::SListPure< ogdf::NodeElement > > | |
| Cogdf::Array< ogdf::Triconnectivity::CompStruct > | |
| Cogdf::Array< PathType > | |
| Cogdf::Array< Prioritized< X *, double >, int > | |
| Cogdf::Array< TCost > | |
| Cogdf::Array< Type > | |
| Cogdf::Array< X, int > | |
| Cogdf::ArrayBuffer< abacus::Constraint * > | |
| Cogdf::ArrayBuffer< abacus::FSVarStat * > | |
| Cogdf::ArrayBuffer< abacus::InfeasCon * > | |
| Cogdf::ArrayBuffer< abacus::PoolSlotRef< abacus::Variable, abacus::Constraint > * > | |
| Cogdf::ArrayBuffer< abacus::Sub * > | |
| Cogdf::ArrayBuffer< BaseType * > | |
| Cogdf::ArrayBuffer< const ogdf::steiner_tree::FullComponentGeneratorDreyfusWagner::DWMData * > | |
| Cogdf::ArrayBuffer< const ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix::DWMData * > | |
| Cogdf::ArrayBuffer< double > | |
| ►Cogdf::ArrayBuffer< edge > | |
| Cogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges | Add edges into a blowup graph and delete them on destruction |
| Cogdf::ArrayBuffer< int > | |
| Cogdf::ArrayBuffer< NodePair > | |
| Cogdf::ArrayBuffer< ogdf::AdjElement > | |
| Cogdf::ArrayBuffer< ogdf::ArrayBuffer< ogdf::NodeElement > > | |
| Cogdf::ArrayBuffer< ogdf::ClusterElement > | |
| Cogdf::ArrayBuffer< ogdf::EdgeElement > | |
| Cogdf::ArrayBuffer< ogdf::NodeElement > | |
| Cogdf::ArrayBuffer< ogdf::PlanRep::Deg1RestoreInfo > | |
| Cogdf::ArrayBuffer< ogdf::steiner_tree::FullComponentStore::Metadata< double > > | |
| Cogdf::ArrayBuffer< ogdf::steiner_tree::FullComponentStore::Metadata< LossMetadata< T > > > | |
| Cogdf::ArrayBuffer< ogdf::steiner_tree::FullComponentStore::Metadata< void > > | |
| Cogdf::ArrayBuffer< ogdf::steiner_tree::LowerBoundDualAscent::TerminalDataReference > | |
| Cogdf::ArrayBuffer< T > | |
| 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::ResolvedTrace | |
| Cbackward::TraceResolverImpl< TAG > | |
| Cbackward::TraceResolverImpl< system_tag::unknown_tag > | |
| ►CBaseEmbedder | |
| Cogdf::embedder::LayersBlockEmbedder< BaseEmbedder, T > | Common functionality for layer-based embedding algorithms |
| Cogdf::matching_blossom::BaseIteratorContainer< ogdf::EdgeElement, ogdf::EdgeElement > | |
| Cogdf::matching_blossom::BaseIteratorContainer< ogdf::NodeElement, ogdf::EdgeElement > | |
| ►Cogdf::BinaryHeapSimple< Prioritized< X *, double >, int > | |
| ►Cogdf::Top10Heap< Prioritized< X *, double >, int > | |
| Cogdf::DeletingTop10Heap< X, Priority, STATICCOMPARER, INDEX > | A variant of Top10Heap which deletes the elements that get rejected from the heap |
| ►Cogdf::BinaryHeapSimple< X, int > | |
| Cogdf::Top10Heap< X, INDEX > | A variant of BinaryHeapSimple which always holds only the 10 elements with the highest keys |
| Cogdf::fast_multipole_embedder::BinCoeff< double > | |
| ►Cogdf::BucketFunc< Edge > | |
| Cogdf::energybased::fmmm::EdgeMaxBucketFunc | |
| Cogdf::energybased::fmmm::EdgeMinBucketFunc | |
| ►Cogdf::BucketFunc< edge > | |
| Cogdf::BucketEdgeArray | Bucket function for edges |
| Cogdf::BucketSourceIndex | Bucket function using the index of an edge's source node as bucket |
| Cogdf::BucketTargetIndex | Bucket function using the index of an edge's target node as bucket |
| Cogdf::embedding_inserter::CrossingsBucket< PLANREP > | Bucket function for sorting edges by decreasing number of crossings |
| ►Cogdf::BucketFunc< MehlhornTriple > | |
| Cogdf::MinSteinerTreeMehlhorn< T >::MehlhornTripleBucketMaxFunc | Helper class to sort MehlhornTriples lexicographically |
| Cogdf::MinSteinerTreeMehlhorn< T >::MehlhornTripleBucketMinFunc | Helper class to sort MehlhornTriples lexicographically |
| ►Cogdf::GF2Solver::ChunkBase< chunkSize, Chunk > | |
| Cogdf::GF2Solver::Chunk | |
| ►Cogdf::GF2Solver::ChunkBase< chunkSize2, Chunk2 > | |
| Cogdf::GF2Solver::Chunk2 | |
| Cogdf::ClusterArrayBase< bool > | |
| Cogdf::ClusterArrayBase< double > | |
| Cogdf::ClusterArrayBase< int > | |
| Cogdf::ClusterArrayBase< ogdf::booth_lueker::EmbedPQTree * > | |
| Cogdf::ClusterArrayBase< ogdf::booth_lueker::PlanarPQTree * > | |
| Cogdf::ClusterArrayBase< ogdf::cluster_planarity::ClusterPQContainer > | |
| Cogdf::ClusterArrayBase< ogdf::ClusterArrayBase< ogdf::ClusterElement > * > | |
| Cogdf::ClusterArrayBase< ogdf::ClusterElement > | |
| Cogdf::ClusterArrayBase< ogdf::ClusterGraph * > | |
| Cogdf::ClusterArrayBase< ogdf::Fill > | |
| Cogdf::ClusterArrayBase< ogdf::Graph * > | |
| Cogdf::ClusterArrayBase< ogdf::internal::EdgeArrayBase2< ogdf::ArrayBuffer< ogdf::EdgeElement > * > * > | |
| Cogdf::ClusterArrayBase< ogdf::internal::GraphRegisteredArray< bool > * > | |
| Cogdf::ClusterArrayBase< ogdf::internal::GraphRegisteredArray< ogdf::ClusterElement > * > | |
| Cogdf::ClusterArrayBase< ogdf::internal::GraphRegisteredArray< ogdf::NodeElement > * > | |
| Cogdf::ClusterArrayBase< ogdf::internal::GraphRegisteredArray< ogdf::SListPure< ogdf::AdjElement > > * > | |
| Cogdf::ClusterArrayBase< ogdf::LHTreeNode * > | |
| Cogdf::ClusterArrayBase< ogdf::List< ogdf::EdgeElement > > | |
| Cogdf::ClusterArrayBase< ogdf::List< ogdf::NodeElement > > | |
| Cogdf::ClusterArrayBase< ogdf::NodeElement > | |
| Cogdf::ClusterArrayBase< ogdf::Stroke > | |
| Cogdf::ClusterArrayBase< string > | |
| Cabacus::CutBuffer< abacus::Constraint, abacus::Variable > | |
| Cabacus::CutBuffer< abacus::Variable, abacus::Constraint > | |
| Cogdf::DefHashFunc< E > | |
| Cogdf::DefHashFunc< I > | |
| Cogdf::DefHashFunc< I1 > | |
| Cogdf::DefHashFunc< I1_ > | |
| Cogdf::DefHashFunc< I2 > | |
| Cogdf::DefHashFunc< I2_ > | |
| Cogdf::DefHashFunc< int > | |
| Cogdf::DefHashFunc< K1_ > | |
| Cogdf::DefHashFunc< K2_ > | |
| Cogdf::DefHashFunc< ogdf::EdgeElement > | |
| Cogdf::DefHashFunc< std::string > | |
| ►Cbackward::details::demangler_impl< system_tag::current_tag > | |
| Cbackward::details::demangler | |
| ►Cogdf::DTreeMultilevelEmbedder< 2 > | |
| Cogdf::DTreeMultilevelEmbedder2D | |
| ►Cogdf::DTreeMultilevelEmbedder< 3 > | |
| Cogdf::DTreeMultilevelEmbedder3D | |
| Cogdf::EdgeWeightedGraph< double > | |
| CMinisat::Internal::Equal< CRef > | |
| ►Cogdf::steiner_tree::FullComponentStore< T, double > | |
| Cogdf::steiner_tree::FullComponentWithExtraStore< T, double > | |
| ►Cogdf::steiner_tree::FullComponentStore< T, LossMetadata< T > > | |
| ►Cogdf::steiner_tree::FullComponentWithExtraStore< T, LossMetadata< T > > | |
| Cogdf::steiner_tree::FullComponentWithLossStore< T > | A data structure to store full components with additional "loss" functionality |
| 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_, DefHashFunc< I1_ >, DefHashFunc< I2_ > > > | |
| Cogdf::HashConstIterator2D< I1_, I2_, E_, Hash1_, Hash2_ > | Const-iterator for 2D-hash arrays |
| Cogdf::HashFuncTuple< I1, I2, DefHashFunc< I1 >, DefHashFunc< I2 > > | |
| Cogdf::HashFuncTuple< I1_, I2_, DefHashFunc< I1_ >, DefHashFunc< I2_ > > | |
| 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, std::less< T > >, int, T, std::less< T > > | |
| Cogdf::BinaryHeap< T, C > | Heap realized by a data array |
| ►Cogdf::HeapBase< BinomialHeap< T, std::less< T > >, BinomialHeapNode< T >, T, std::less< T > > | |
| Cogdf::BinomialHeap< T, C > | Binomial heap implementation |
| ►Cogdf::HeapBase< FibonacciHeap< T, std::less< T > >, FibonacciHeapNode< T >, T, std::less< T > > | |
| Cogdf::FibonacciHeap< T, C > | Fibonacci heap implementation |
| ►Cogdf::HeapBase< PairingHeap< T, C >, PairingHeapNode< T >, T, C > | |
| Cogdf::PairingHeap< T, C > | Pairing heap implementation |
| ►Cogdf::HeapBase< RMHeap< T, std::less< T > >, RMHeapNode< T >, T, std::less< T > > | |
| Cogdf::RMHeap< T, C > | Randomized meldable heap implementation |
| Cogdf::pc_tree::IntrusiveList< ogdf::pc_tree::PCNode > | |
| Cogdf::List< abacus::Constraint * > | |
| Cogdf::List< abacus::Sub * > | |
| Cogdf::List< double > | |
| Cogdf::List< edge > | |
| Cogdf::List< int > | |
| ►Cogdf::List< ogdf::AdjElement > | |
| Cogdf::ListContainer< ogdf::AdjElement, ogdf::ClusterElement > | |
| Cogdf::List< ogdf::BertaultLayout::CCElement * > | |
| ►Cogdf::List< ogdf::ClusterElement > | |
| Cogdf::ListContainer< ogdf::ClusterElement, ogdf::ClusterElement > | |
| Cogdf::List< ogdf::davidson_harel::EnergyFunction * > | |
| Cogdf::List< ogdf::davidson_harel::Planarity::ChangedCrossing > | |
| Cogdf::List< ogdf::EdgeElement > | |
| Cogdf::List< ogdf::energybased::fmmm::ParticleInfo > | |
| Cogdf::List< ogdf::energybased::fmmm::QuadTreeNodeNM * > | |
| Cogdf::List< ogdf::GenericPoint > | |
| Cogdf::List< ogdf::Graph::HiddenEdgeSet * > | |
| Cogdf::List< ogdf::LeftistOrdering::Candidate > | |
| Cogdf::List< ogdf::LHTreeNode::Adjacency > | |
| Cogdf::List< ogdf::LHTreeNode::ClusterCrossing > | |
| Cogdf::List< ogdf::List< ogdf::AdjElement > > | |
| Cogdf::List< ogdf::List< ogdf::FaceElement > > | |
| Cogdf::List< ogdf::List< ogdf::NodeElement > > | |
| Cogdf::List< ogdf::MultiEdgeApproxInserter::VertexBlock > | |
| ►Cogdf::List< ogdf::NodeElement > | |
| Cogdf::ListContainer< ogdf::NodeElement, ogdf::ClusterElement > | |
| Cogdf::List< ogdf::NodePair > | |
| Cogdf::List< ogdf::PALabel > | |
| Cogdf::List< ogdf::PlanRepExpansion::Crossing > | |
| Cogdf::List< ogdf::PlanRepExpansion::NodeSplit > | |
| Cogdf::List< ogdf::PQNode< edge, IndInfo *, bool > * > | |
| Cogdf::List< ogdf::PQNode< edge, ogdf::whaInfo *, bool > * > | |
| Cogdf::List< ogdf::PQNode< edge, whaInfo *, bool > * > | |
| Cogdf::List< ogdf::PQNode< T, ogdf::whaInfo *, Y > * > | |
| Cogdf::List< ogdf::PQNode< T, whaInfo *, Y > * > | |
| Cogdf::List< ogdf::PQNode< T, X, Y > * > | |
| Cogdf::List< ogdf::steiner_tree::LowerBoundDualAscent::TerminalData > | |
| Cogdf::List< ogdf::steiner_tree::Triple< T > > | |
| Cogdf::List< ogdf::sync_plan::Pipe > | |
| Cogdf::List< ogdf::sync_plan::SyncPlan::UndoOperation * > | |
| Cogdf::List< PipeBijPair > | |
| ►Cogdf::List< PointType > | |
| ►Cogdf::GenericPolyline< PointType > | Polylines with PointType points |
| Cogdf::DPolygon | Polygons with real coordinates |
| Cogdf::List< std::tuple< int, int, ogdf::List > > | |
| Cogdf::List< Tuple2< node, int > > | |
| Cogdf::ListElement< ClusterGraphObserver * > | |
| Cogdf::ListElement< GraphObserver * > | |
| Cogdf::ListElement< HypergraphObserver * > | |
| Cogdf::ListElement< int > | |
| Cogdf::ListElement< ogdf::NodeElement > | |
| Cogdf::ListElement< TObserver * > | |
| Cogdf::ListIteratorBase< int > | |
| Cogdf::ListIteratorBase< ogdf::ClusterElement > | |
| Cogdf::ListIteratorBase< ogdf::energybased::fmmm::ParticleInfo > | |
| Cogdf::ListIteratorBase< ogdf::Graph::HiddenEdgeSet * > | |
| Cogdf::ListIteratorBase< ogdf::InOutPoint > | |
| Cogdf::ListIteratorBase< ogdf::ListIteratorBase< ogdf::steiner_tree::LowerBoundDualAscent::TerminalData > > | |
| Cogdf::ListIteratorBase< ogdf::NodeElement > | |
| Cogdf::ListIteratorBase< ogdf::PlanRepExpansion::NodeSplit > | |
| Cogdf::ListIteratorBase< ogdf::topology_module::EdgeLeg * > | |
| Cogdf::ListPure< ClusterGraphObserver * > | |
| Cogdf::ListPure< GraphObserver * > | |
| Cogdf::ListPure< HypergraphObserver * > | |
| Cogdf::ListPure< int > | |
| Cogdf::ListPure< ogdf::NodeElement > | |
| Cogdf::ListPure< TObserver * > | |
| Cabacus::LpSolution< CoType, BaseType > | |
| CMinisat::Internal::Map< CRef, T, CRefHash > | |
| Cmapbox::detail::Earcut< N > | |
| Cmapbox::detail::Earcut< N >::Node | |
| Cmapbox::detail::Earcut< N >::ObjectPool< T, Alloc > | |
| Cmapbox::util::nth< I, T > | |
| Cogdf::MaxFlowModule< double > | |
| Cogdf::MaxFlowModule< int > | |
| ►Cogdf::MaxFlowModule< TCap > | |
| Cogdf::MaxFlowEdmondsKarp< TCap > | Computes a max flow via Edmonds-Karp |
| Cogdf::MaxFlowGoldbergTarjan< TCap > | Computes a max flow via Preflow-Push (global relabeling and gap relabeling heuristic) |
| Cogdf::MaxFlowSTPlanarDigraph< TCap > | Computes a max flow in s-t-planar network via dual shortest paths |
| Cogdf::MaxFlowSTPlanarItaiShiloach< TCap > | Computes a max flow in s-t-planar network via uppermost paths |
| ►Cogdf::MinimumCutModule< double > | |
| Cogdf::MinimumCutStoerWagner< T > | Computes a minimum cut in a graph |
| ►Cogdf::MinimumCutModule< int > | |
| Cogdf::MinimumCutNagamochiIbaraki | Calculate minimum cut value for a given Graph |
| Cogdf::MinimumEdgeDistances< int > | |
| CMinisat::Clause | Represents 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::Formula | The Formula class |
| CMinisat::Internal::SimpSolver | |
| 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::Model | Represents a simple class for model storage |
| Cogdf::MinSteinerTreeModule< double > | |
| Cmapbox::detail::Earcut< N >::ObjectPool< mapbox::detail::Earcut::Node > | |
| ►Cogdf::Observable< ClusterGraphObserver, ClusterGraph > | |
| ►Cogdf::ClusterGraph | Representation of clustered graphs |
| Cogdf::ClusterGraphCopy | |
| ►Cogdf::Observable< GraphObserver, Graph > | |
| ►Cogdf::Graph | Data type for general directed graphs (adjacency list representation) |
| ►Cogdf::CommonCompactionConstraintGraphBase | Base class for ogdf::CompactionConstraintGraphBase |
| ►Cogdf::CompactionConstraintGraphBase | Class implementing template-parameter-independent behaviour of ogdf::CompactionConstraintGraph |
| Cogdf::CompactionConstraintGraph< ATYPE > | Represents a constraint graph used for compaction |
| Cogdf::ExpansionGraph | Represents expansion graph of each biconnected component of a given digraph, i.e., each vertex v with in- and outdegree greater than 1 is expanded into two vertices x and y connected by an edge x->y such that all incoming edges are moved from v to x and all outgoing edges from v to y |
| Cogdf::ExtendedNestingGraph | |
| Cogdf::FaceSinkGraph | |
| ►Cogdf::GraphCopyBase | |
| ►Cogdf::GraphCopy | Copies of graphs supporting edge splitting |
| Cogdf::EdgeWeightedGraphCopy< T > | |
| ►Cogdf::PlanRep | Planarized representations (of a connected component) of a graph |
| Cogdf::ClusterPlanRep | Planarized representations for clustered graphs |
| ►Cogdf::PlanRepUML | Planarized representation (of a connected component) of a UMLGraph; allows special handling of hierarchies in the graph |
| Cogdf::PlanRepInc | This class is only an adaption of PlanRep for the special incremental drawing case |
| Cogdf::PlanRepLight | Light-weight version of a planarized representation, associated with a PlanRep |
| Cogdf::UpwardPlanRep | Upward planarized representations (of a connected component) of a graph |
| Cogdf::GraphCopySimple | Copies of graphs with mapping between nodes and edges |
| Cogdf::GraphReduction | Creates a reduced graph by removing leaves, self-loops, and reducing chains |
| Cogdf::OverlappingGraphCopy | Version of GraphCopySimple that may efficiently share some overlap with other instances of the same original Graph via its OverlappingGraphCopies manager |
| Cogdf::PlanRepExpansion | Planarized representations (of a connected component) of a graph |
| Cogdf::TwoSAT | A simple solver for TwoSAT instances, representing the instance as implication graph and solving it via its strongly-connected components |
| Cogdf::UmlModelGraph | This class represents the complete UML Model in a graph-like data structure |
| ►Cogdf::Observable< HypergraphObserver, Hypergraph > | |
| Cogdf::Hypergraph | |
| ►Cogdf::Observer< ClusterGraph, ClusterGraphObserver > | |
| Cogdf::ClusterGraphObserver | Abstract base class for cluster graph observers |
| ►Cogdf::Observer< Graph, GraphObserver > | |
| ►Cogdf::GraphObserver | Abstract Base class for graph observers |
| Cogdf::ClusterGraph | Representation of clustered graphs |
| Cogdf::PlanRepInc | This class is only an adaption of PlanRep for the special incremental drawing case |
| Cogdf::sync_plan::PMatching | Manages the matching of P-nodes via pipes in an instance of SyncPlan |
| Cogdf::sync_plan::QPartitioning | Manages the partitioning of Q-nodes in an instance of SyncPlan |
| ►Cogdf::Observer< Hypergraph, HypergraphObserver > | |
| ►Cogdf::HypergraphObserver | |
| Cogdf::EdgeStandardRep | Edge standard representation of hypergraphs |
| 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::AcyclicSubgraphModule | Base class of algorithms for computing a maximal acyclic subgraph |
| Cogdf::DfsAcyclicSubgraph | DFS-based algorithm for computing a maximal acyclic subgraph |
| Cogdf::GreedyCycleRemoval | Greedy algorithm for computing a maximal acyclic subgraph |
| Cogdf::AdjacencyOracle | Tells you in constant time if two nodes are adjacent |
| 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::ArrayBuffer< E, INDEX > | An array that keeps track of the number of inserted elements; also usable as an efficient stack |
| 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::AugmentationModule | The base class for graph augmentation algorithms |
| Cogdf::DfsMakeBiconnected | Implementation of a DFS-based algorithm for biconnectivity augmentation |
| Cogdf::PlanarAugmentation | The algorithm for planar biconnectivity augmentation (Mutzel, Fialko) |
| Cogdf::PlanarAugmentationFix | The algorithm for biconnectivity augmentation with fixed combinatorial embedding |
| Cogdf::Barrier | Representation of a barrier |
| Cogdf::BasicPageRank | Basic page rank calculation |
| ►Cogdf::BCTree | Static BC-trees |
| ►Cogdf::DynamicBCTree | Dynamic BC-trees |
| ►Cogdf::DynamicSPQRForest | Dynamic SPQR-forest |
| ►Cogdf::DynamicSPQRTree | Linear-time implementation of dynamic SPQR-trees |
| Cogdf::DynamicPlanarSPQRTree | SPQR-trees of planar graphs |
| Cogdf::BendString | Represents the bends on an edge e consisting of vertical and horizontal segments |
| Cogdf::BertaultLayout::BertaultSections | The sections associated with each node |
| Cogdf::BertaultLayout::CCElement | Objects of this class are members of the containment heirarchy made in preprocessing stage of ImPrEd |
| Cogdf::BertaultLayout::proj | Structure 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::Block | Class representing idea of Blocks used in GlobalSifting and GridSifting algorithms |
| Cogdf::booth_lueker::IndInfo | |
| Cogdf::booth_lueker::PlanarLeafKey< X > | |
| Cogdf::BoundedQueue< E, INDEX > | The parameterized class BoundedQueue implements queues with bounded size |
| Cogdf::boyer_myrvold::BoyerMyrvoldInit | This class is used in the Boyer-Myrvold planarity test for preprocessing purposes |
| Cogdf::BoyerMyrvoldPlanar | This class implements the extended BoyerMyrvold planarity embedding algorithm |
| Cogdf::BucketFunc< E > | Abstract base class for bucket functions |
| ►Cogdf::CCLayoutPackModule | Base class of algorithms that arrange/pack layouts of connected components |
| Cogdf::TileToRowsCCPacker | The tile-to-rows algorithm for packing drawings of connected components |
| Cogdf::CconnectClusterPlanar | C-planarity test by Cohen, Feng and Eades |
| Cogdf::CconnectClusterPlanarEmbed | C-planarity test and embedding by Cohen, Feng and Eades |
| ►Cogdf::CliqueFinderModule | Finds cliques |
| Cogdf::CliqueFinderHeuristic | Finds cliques and dense subgraphs using a heuristic |
| Cogdf::CliqueFinderSPQR | Finds cliques using SPQR trees |
| Cogdf::cluster_planarity::ClusterPQContainer | |
| Cogdf::cluster_planarity::CPlanaritySub::KuraSize | |
| Cogdf::cluster_planarity::CPlanarSubClusteredST | Constructs a c-planar subclustered spanning tree of the input by setting edgearray values |
| Cogdf::cluster_planarity::edgeValue | Struct for attaching the current lp-value to the corresponding edge. Used in the primal heuristic |
| Cogdf::ClusterAnalysis | |
| Cogdf::ClusterArrayBase< Value, WithDefault > | RegisteredArray for labeling the clusters of a ClusterGraph |
| ►Cogdf::ClustererModule | Interface for algorithms that compute a clustering for a given graph |
| Cogdf::Clusterer | |
| Cogdf::ClusterGraphCopyAttributes | Manages access on copy of an attributed clustered graph |
| Cogdf::ClusterOrthoShaper | Computes the orthogonal representation of a clustered graph |
| Cogdf::ClusterPlanarizationLayout | The cluster planarization layout algorithm |
| Cogdf::ClusterPlanarizationLayout::ClusterPosition | |
| Cogdf::CoffmanGrahamRanking::_int_set | |
| Cogdf::CoinManager | If you use COIN-OR, you should use this class |
| Cogdf::Color | Colors represented as RGBA values |
| Cogdf::CompactionConstraintGraph< ATYPE >::Interval | Represents an interval on the sweep line |
| Cogdf::CompactionConstraintGraph< ATYPE >::SegmentComparer | Comparer 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::Configuration | Provides information about how OGDF has been configured |
| Cogdf::ConnectivityTester | Naive implementation for testing the connectivity of a graph |
| Cogdf::ConvexHull | Computes the convex hull of a set of points or a layout |
| Cogdf::CPlanarEdgeInserter | Edge insertion algorithm for clustered graphs |
| Cogdf::CPlanarSubClusteredGraph | Constructs a c-planar subclustered graph of the input based on a spanning tree |
| Cogdf::CrossingsMatrix | Implements crossings matrix which is used by some TwoLayerCrossingMinimization heuristics (e.g. split) |
| Cogdf::CrossingVertexOrder | |
| ►Cogdf::davidson_harel::EnergyFunction | The interface for energy functions for the Davidson Harel graph drawing method |
| ►Cogdf::davidson_harel::NodePairEnergy | |
| Cogdf::davidson_harel::Attraction | Energy function for attraction between two adjacent vertices |
| Cogdf::davidson_harel::Overlap | |
| Cogdf::davidson_harel::Repulsion | |
| Cogdf::davidson_harel::Planarity | |
| Cogdf::davidson_harel::PlanarityGrid | |
| Cogdf::davidson_harel::Planarity::ChangedCrossing | |
| Cogdf::davidson_harel::UniformGrid | |
| Cogdf::DavidsonHarel | The 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::disjoint_sets::CompressionOption< compressionOption > | |
| Cogdf::disjoint_sets::InterleavingOption< interleavingOption > | |
| Cogdf::disjoint_sets::LinkOption< linkOption > | |
| Cogdf::DisjointSets< linkOption, compressionOption, interleavingOption > | A Union/Find data structure for maintaining disjoint sets |
| Cogdf::DLParser | |
| Cogdf::dot::Ast | DOT 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::NodeId | |
| Cogdf::dot::Ast::Subgraph | |
| Cogdf::dot::Ast::EdgeRhs | |
| Cogdf::dot::Ast::Graph | |
| Cogdf::dot::Ast::Port | |
| ►Cogdf::dot::Ast::Stmt | |
| Cogdf::dot::Ast::AsgnStmt | |
| Cogdf::dot::Ast::AttrStmt | |
| Cogdf::dot::Ast::EdgeStmt | |
| Cogdf::dot::Ast::NodeStmt | |
| Cogdf::dot::Ast::Subgraph | |
| Cogdf::dot::Ast::StmtList | |
| Cogdf::dot::Lexer | Lexical analysis tool |
| Cogdf::dot::Parser | DOT format parser class |
| Cogdf::dot::SubgraphData | A helper structure containing information for recursive graph reading |
| Cogdf::dot::Token | Just a simple token struct representing a DOT file fragment |
| ►Cogdf::DRect | Rectangles with real coordinates |
| Cogdf::DIntersectableRect | Rectangles with real coordinates |
| Cogdf::DTreeMultilevelEmbedder< Dim > | |
| Cogdf::DTreeMultilevelEmbedder< Dim >::NodeCoords | |
| Cogdf::DualGraphBase< isConst > | A dual graph including its combinatorial embedding of an embedded graph |
| Cogdf::edge_router::NodeInfo | |
| Cogdf::EdgeIndependentSpanningTrees | Calculates k edge-independent spanning trees of a graph |
| Cogdf::EdgeLabel< coordType > | |
| Cogdf::EdgeOrderComparer | Orders edges such that they do not cross each other when embeddded as insertion paths |
| Cogdf::EdgeRouter | Places node boxes in replacement areas of orthogonal drawing step and route edges to minimize bends |
| Cogdf::EdgeSet< SupportFastSizeQuery > | Edge sets |
| Cogdf::EdgeWeightedGraph< T > | |
| Cogdf::ELabelInterface< coordType > | |
| Cogdf::ELabelPosSimple | |
| Cogdf::embedder::ConnectedSubgraph< T > | |
| Cogdf::embedder::CrossingStructure | |
| Cogdf::embedder::MDMFLengthAttribute | Auxiliary length attribute |
| ►Cogdf::EmbedderMaxFaceBiconnectedGraphs< T > | Embedder that maximizing the external face |
| Cogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T > | Embedder that maximizes the external face (plus layers approach) |
| Cogdf::energybased::dtree::DTree< IntType, Dim > | Implentation of the reduced quadtree for Dim dimensions |
| Cogdf::energybased::dtree::DTree< IntType, Dim >::MortonEntry | The entry in the sorted order for a point |
| Cogdf::energybased::dtree::DTree< IntType, Dim >::Node | The node class |
| Cogdf::energybased::dtree::DTree< IntType, Dim >::Point | The point class with integer coords |
| Cogdf::energybased::dtree::DTreeEmbedder< Dim > | |
| Cogdf::energybased::dtree::DTreeEmbedder< Dim >::NodeInfo | Node state |
| Cogdf::energybased::dtree::DTreeForce< Dim > | |
| Cogdf::energybased::dtree::DTreeForce< Dim >::NodeData | Node data |
| Cogdf::energybased::dtree::DTreeForce< Dim >::PointData | Point data |
| Cogdf::energybased::dtree::DTreeWSPD< Dim > | |
| Cogdf::energybased::dtree::DTreeWSPD< Dim >::NodeData | Geometry for the quadtree nodes |
| Cogdf::energybased::dtree::DTreeWSPD< Dim >::PointData | World coordinates of the points |
| Cogdf::energybased::dtree::GalaxyLevel | Simple implementation of the slightly modified version of Hachul by Gronemann |
| ►Cogdf::energybased::dtree::IWSPD | |
| Cogdf::energybased::dtree::DTreeWSPDCallback< Dim, ForceFunc, UseForcePrime > | |
| Cogdf::energybased::fmmm::Edge | Helping data structure for deleting parallel edges in class FMMMLayout and Multilevel (needed for the bucket sort algorithm) |
| Cogdf::energybased::fmmm::EdgeAttributes | Helping 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::MAARPacking | Data 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::Node | Data structure for representing nodes and an int value (needed for class ogdf/list) to perform bucket sort |
| Cogdf::energybased::fmmm::NodeAttributes | Helping data structure that stores the graphical attributes of a node that are needed for the force-directed algorithms |
| Cogdf::energybased::fmmm::numexcept | This 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::PackingRowInfo | Helping data structure for MAARPacking |
| Cogdf::energybased::fmmm::ParticleInfo | Helping data structure for building up the reduced quad tree by NMM |
| Cogdf::energybased::fmmm::QuadTreeNM | Helping data structure that stores the information needed to represent the modified quadtree in the New Multipole Method (NMM) |
| Cogdf::energybased::fmmm::QuadTreeNodeNM | Helping 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::Rectangle | Helping 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::Set | Helping 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::ENGLayer | Represents layer in an extended nesting graph |
| Cogdf::EpsilonTest | |
| Cogdf::ExternE | List of externally active nodes strictly between x and y for minortypes B and E |
| Cogdf::ExtractKuratowskis | Extracts multiple Kuratowski Subdivisions |
| 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::D2DFunctor | Calculates the repulsive forces acting between all nodes of the direct interacting cells of the i-th node |
| Cogdf::fast_multipole_embedder::do_nothing | Useless do nothing function |
| Cogdf::fast_multipole_embedder::EdgeAdjInfo | Information 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::FMESingleKernel | |
| Cogdf::fast_multipole_embedder::FMEGlobalContext | Global Context |
| Cogdf::fast_multipole_embedder::FMEGlobalOptions | Main global options for a run |
| ►Cogdf::fast_multipole_embedder::FMEKernel | |
| Cogdf::fast_multipole_embedder::FMEMultipoleKernel | |
| Cogdf::fast_multipole_embedder::FMELocalContext | Local thread Context |
| Cogdf::fast_multipole_embedder::FMENodeChainPartition | |
| ►Cogdf::fast_multipole_embedder::FMETask | The thread task class used only as an interface |
| Cogdf::fast_multipole_embedder::FMEFuncInvokerTask< FuncInvokerType > | Class used to invoke a functor or function inside a thread |
| Cogdf::fast_multipole_embedder::FMEThread | The fast multipole embedder work thread class |
| Cogdf::fast_multipole_embedder::FMEThreadPool | |
| Cogdf::fast_multipole_embedder::FMETreePartition | Struct 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_functor | Local-to-Local functor |
| Cogdf::fast_multipole_embedder::l2p_functor | Local-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::LinearQuadtreeBuilder | Builder for the LinearQuadtree |
| Cogdf::fast_multipole_embedder::LinearQuadtreeExpansion | |
| Cogdf::fast_multipole_embedder::LQCoordsFunctor | Computes the coords and size of the i-th node in the LinearQuadtree |
| Cogdf::fast_multipole_embedder::LQMortonFunctor | |
| Cogdf::fast_multipole_embedder::LQPartitioner | The 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_functor | Multipole-to-Local functor |
| Cogdf::fast_multipole_embedder::M2LFunctor | Converts 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_functor | Multipole-to-Multipole functor |
| Cogdf::fast_multipole_embedder::min_max_functor< T > | Generic min max functor for an array |
| Cogdf::fast_multipole_embedder::NDFunctor | Calculates the repulsive forces acting between all nodes inside the cell of the i-th LinearQuadtree node |
| Cogdf::fast_multipole_embedder::NodeAdjInfo | Information 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_functor | Point-to-Multipole functor |
| Cogdf::fast_multipole_embedder::p2p_functor | Local-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::RandomNodeSet | Utility class to select multiple nodes randomly |
| Cogdf::fast_multipole_embedder::WSPD | Class for the Well-Separated-Pairs-Decomposition (WSPD) |
| Cogdf::FibonacciHeapNode< T > | Fibonacci heap node |
| Cogdf::Fill | Properties of fills |
| Cogdf::FilteringBFS | An iterator-based BFS through a Graph |
| Cogdf::FilteringBFSIterator | |
| Cogdf::FindKuratowskis | This class collects information about Kuratowski Subdivisions which is used for extraction later |
| Cogdf::FlowCompaction | Compaction algorithm using min-cost flow in the dual of the constraint graph |
| Cogdf::FMMMOptions | |
| Cogdf::FourBlockTree | A node in a 4-block tree |
| Cogdf::gdf::Parser | |
| Cogdf::GenericComparer< ELEM, NUM, ascending > | Compare elements based on a single comparable attribute |
| ►Cogdf::GenericLine< PointType > | Infinite lines |
| Cogdf::GenericSegment< PointType > | Finite line segments |
| 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< TCost > | This is a helper class to make the glueing of two edges simpler |
| Cogdf::gml::Object | Represents node in GML parse tree |
| Cogdf::gml::Parser | Reads GML file and constructs GML parse tree |
| Cogdf::Graph::CCsInfo | Info structure for maintaining connected components |
| Cogdf::Graph::HiddenEdgeSet | Functionality for temporarily hiding edges in constant time |
| Cogdf::GraphAdjIterator | Iterator for AdjEntries of a graph |
| ►Cogdf::GraphAttributes | Stores additional attributes of a graph (like layout information) |
| Cogdf::ClusterGraphAttributes | Stores additional attributes of a clustered graph (like layout information) |
| Cogdf::UMLGraph | |
| Cogdf::GraphIO | Utility class providing graph I/O in various exchange formats |
| Cogdf::GraphIO::FileType | |
| Cogdf::GraphIO::SVGSettings | Condensed settings for drawing SVGs |
| Cogdf::GraphMLParser | |
| ►Cogdf::GridLayout | Representation of a graph's grid layout |
| Cogdf::GridLayoutMapped | Extends GridLayout by a grid mapping mechanism |
| Cogdf::HananiTutteCPlanarity::HananiTutteSolver | |
| Cogdf::HananiTutteCPlanarity::Stats | |
| Cogdf::HashConstIterator< K, I, H > | Iterators for hash tables |
| ►Cogdf::HashElementBase | Base class for elements within a hash table |
| Cogdf::HashElement< Tuple2< I1_, I2_ >, E_ > | |
| Cogdf::HashElement< K, I > | Representation of elements in a hash table |
| Cogdf::HashFuncTuple< K1_, K2_, Hash1_, Hash2_ > | |
| ►Cogdf::HashingBase | Base class for hashing with chaining and table doubling |
| ►Cogdf::Hashing< E, PrioritizedQueue< E, P, std::less< P >, PairingHeap >::Handle, DefHashFunc< E > > | |
| Cogdf::HashArray< E, PrioritizedQueue< E, P, std::less< P >, PairingHeap >::Handle, DefHashFunc< E > > | |
| ►Cogdf::Hashing< I, E, DefHashFunc< I > > | |
| Cogdf::HashArray< I, E, H > | Indexed arrays using hashing for element access |
| ►Cogdf::Hashing< int, int, DefHashFunc< int > > | |
| Cogdf::HashArray< int, int > | |
| ►Cogdf::Hashing< int, ogdf::ClusterElement, DefHashFunc< int > > | |
| Cogdf::HashArray< int, ogdf::ClusterElement > | |
| ►Cogdf::Hashing< int, ogdf::ListIteratorBase< int >, DefHashFunc< int > > | |
| Cogdf::HashArray< int, ogdf::ListIteratorBase< int > > | |
| Cogdf::Hashing< K, I, DefHashFunc< K > > | |
| ►Cogdf::Hashing< ogdf::EdgeElement, PrioritizedQueue< ogdf::EdgeElement, TCap, std::less< TCap >, PairingHeap >::Handle, DefHashFunc< ogdf::EdgeElement > > | |
| Cogdf::HashArray< ogdf::EdgeElement, PrioritizedQueue< ogdf::EdgeElement, TCap, std::less< TCap >, PairingHeap >::Handle, DefHashFunc< ogdf::EdgeElement > > | |
| Cogdf::Hashing< ogdf::List< ogdf::NodeElement >, ogdf::steiner_tree::FullComponentGeneratorDreyfusWagner::DWMData, ogdf::steiner_tree::FullComponentGeneratorDreyfusWagner::SortedNodeListHashFunc > | |
| Cogdf::Hashing< ogdf::List< ogdf::NodeElement >, ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix::DWMData, ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix::SortedNodeListHashFunc > | |
| ►Cogdf::Hashing< std::string, ogdf::NodeElement, DefHashFunc< std::string > > | |
| Cogdf::HashArray< std::string, ogdf::NodeElement > | |
| ►Cogdf::Hashing< Tuple2< I1, I2 >, E, HashFuncTuple< I1, I2, DefHashFunc< I1 >, DefHashFunc< I2 > > > | |
| Cogdf::HashArray2D< I1, I2, E, H1, H2 > | Indexed 2-dimensional arrays using hashing for element access |
| Cogdf::Hashing< Tuple2< I1_, I2_ >, E_, HashFuncTuple< I1_, I2_, DefHashFunc< I1_ >, DefHashFunc< I2_ > > > | |
| ►Cogdf::Hashing< Tuple2< int, int >, ogdf::List< ogdf::EdgeElement >, HashFuncTuple< int, int, DefHashFunc< int >, DefHashFunc< int > > > | |
| Cogdf::HashArray2D< int, int, ogdf::List< ogdf::EdgeElement > > | |
| Cogdf::Hashing< K, I, H > | Hashing with chaining and table doubling |
| Cogdf::HeapBase< IMPL, H, T, C > | Common interface for all heap classes |
| Cogdf::Hierarchy | Representation of proper hierarchies used by Sugiyama-layout |
| ►Cogdf::HierarchyClusterLayoutModule | Interface of hierarchy layout algorithms for cluster graphs |
| Cogdf::OptimalHierarchyClusterLayout | The LP-based hierarchy cluster layout algorithm |
| ►Cogdf::HierarchyLayoutModule | Interface of hierarchy layout algorithms |
| Cogdf::FastHierarchyLayout | Coordinate assignment phase for the Sugiyama algorithm by Buchheim et al |
| Cogdf::FastSimpleHierarchyLayout | Coordinate assignment phase for the Sugiyama algorithm by Ulrik Brandes and Boris Köpf |
| Cogdf::OptimalHierarchyLayout | The LP-based hierarchy layout algorithm |
| ►Cogdf::HierarchyLevelsBase | |
| Cogdf::BlockOrder | Hierarchical graph representation used by GlobalSifting and GridSifting algorithms |
| Cogdf::HierarchyLevels | Representation of proper hierarchies used by Sugiyama-layout |
| Cogdf::HotQueue< V, P, H > | Heap-on-Top queue implementation |
| Cogdf::HotQueue< V, P, H >::HeapComparator | Comparator 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::HypergraphAttributes | Stores additional attributes of a hypergraph |
| Cogdf::HypergraphAttributesES | Stores additional attributes of edge standard representation of a hypergraph |
| ►Cogdf::HypergraphLayoutModule | Interface of hypergraph layout algorithms |
| Cogdf::HypergraphLayoutES | |
| ►Cogdf::IncNodeInserter | |
| Cogdf::SimpleIncNodeInserter | |
| Cogdf::Initialization | The class Initialization is used for initializing global variables |
| ►Cogdf::InitialPlacer | Base class for placer modules |
| Cogdf::BarycenterPlacer | The barycenter placer for multilevel layout |
| Cogdf::CirclePlacer | The circle placer for multilevel layout |
| Cogdf::MedianPlacer | The median placer for multilevel layout |
| Cogdf::RandomPlacer | The random placer for multilevel layout |
| Cogdf::SolarPlacer | The solar placer for multilevel layout |
| Cogdf::ZeroPlacer | The zero placer for multilevel layout |
| Cogdf::InOutPoint | Representation of an in- or outpoint |
| Cogdf::internal::FaceAdjContainer | Container for the adjacency entries in a face |
| Cogdf::internal::FaceAdjIterator | Forward iterator for adjacency entries in a face |
| Cogdf::internal::gcm::datastructure::FilterIterator< Iterator > | |
| Cogdf::internal::gcm::datastructure::IteratorRange< Iterator > | |
| Cogdf::internal::gcm::datastructure::TimestampFlags | |
| Cogdf::internal::gcm::datastructure::UnionFind | Implements the Union Find Datastructure to maintain disjoint sets efficiently |
| Cogdf::internal::gcm::graph::Dijkstra< Graph, Flags > | |
| Cogdf::internal::gcm::graph::Drawing< Kernel, Graph > | |
| Cogdf::internal::gcm::graph::OGDFEntryIterator< _Entry > | Iterate over entries of an ogdf graph |
| Cogdf::internal::GraphArrayIteratorBase< ArrayType, isConst > | |
| ►Cogdf::internal::GraphElement | The base class for objects used by (hyper)graphs |
| Cogdf::AdjElement | Class for adjacency list elements |
| Cogdf::AdjHypergraphElement | Class for adjacency list elements |
| Cogdf::ClusterElement | Representation of clusters in a clustered graph |
| Cogdf::EdgeElement | Class for the representation of edges |
| Cogdf::FaceElement | Faces in a combinatorial embedding |
| Cogdf::HyperedgeElement | Class for the representation of hyperedges |
| Cogdf::HypernodeElement | Class for the representation of hypernodes |
| Cogdf::NodeElement | Class for the representation of nodes |
| Cogdf::internal::GraphIteratorBase< GraphObjectPtr, isReverse, isConst > | |
| ►Cogdf::internal::GraphListBase | Base class for GraphElement lists |
| ►Cogdf::internal::GraphList< GraphObject > | |
| Cogdf::internal::GraphObjectContainer< GraphObject > | Public read-only interface for lists of graph objects |
| ►Cogdf::internal::GraphList< ogdf::AdjElement > | |
| Cogdf::internal::GraphObjectContainer< ogdf::AdjElement > | |
| Cogdf::internal::GraphList< ogdf::AdjHypergraphElement > | |
| ►Cogdf::internal::GraphList< ogdf::ClusterElement > | |
| Cogdf::internal::GraphObjectContainer< ogdf::ClusterElement > | |
| ►Cogdf::internal::GraphList< ogdf::EdgeElement > | |
| Cogdf::internal::GraphObjectContainer< ogdf::EdgeElement > | |
| ►Cogdf::internal::GraphList< ogdf::FaceElement > | |
| Cogdf::internal::GraphObjectContainer< ogdf::FaceElement > | |
| Cogdf::internal::GraphList< ogdf::HyperedgeElement > | |
| Cogdf::internal::GraphList< ogdf::HypernodeElement > | |
| ►Cogdf::internal::GraphList< ogdf::NodeElement > | |
| Cogdf::internal::GraphObjectContainer< ogdf::NodeElement > | |
| Cogdf::internal::GraphList< T > | Lists of graph objects (like nodes, edges, etc.) |
| ►Cogdf::internal::RegisteredArrayBase< Registry > | Abstract base class for registered arrays |
| ►Cogdf::internal::RegisteredArrayWithoutDefaultOrIndexAccess< Registry, Value > | Registered arrays without default values or by-index access to values |
| Cogdf::internal::RegisteredArrayWithoutDefaultWithIndexAccess< Registry, Value > | RegisteredArrayWithoutDefaultOrIndexAccess that also allows accessing its values directly by their index |
| Cogdf::internal::SimpleRange< It > | |
| Cogdf::IOPoints | Representation of in- and outpoint lists |
| Cogdf::KuratowskiStructure | A Kuratowski Structure is a special graph structure containing severals subdivisions |
| Cogdf::KuratowskiWrapper | Wrapper-class for Kuratowski Subdivisions containing the minortype and edgelist |
| ►Cogdf::LayeredCrossMinModule | Interface of crossing minimization algorithms for layered graphs |
| Cogdf::GlobalSifting | The global sifting heuristic for crossing minimization |
| Cogdf::GridSifting | The grid sifting heuristic for crossing minimization |
| ►Cogdf::LayerByLayerSweep | Interface of two-layer crossing minimization algorithms |
| Cogdf::BarycenterHeuristic | The barycenter heuristic for 2-layer crossing minimization |
| Cogdf::GreedyInsertHeuristic | The greedy-insert heuristic for 2-layer crossing minimization |
| Cogdf::GreedySwitchHeuristic | The greedy-switch heuristic for 2-layer crossing minimization |
| Cogdf::MedianHeuristic | The median heuristic for 2-layer crossing minimization |
| Cogdf::SiftingHeuristic | The sifting heuristic for 2-layer crossing minimization |
| ►Cogdf::TwoLayerCrossMinSimDraw | |
| Cogdf::SplitHeuristic | The split heuristic for 2-layer crossing minimization |
| Cogdf::Layout | Stores a layout of a graph (coordinates of nodes, bend points of edges) |
| ►Cogdf::LayoutClusterPlanRepModule | Interface for planar cluster layout algorithms |
| Cogdf::ClusterOrthoLayout | Represents a planar orthogonal drawing algorithm for c-planar, c-connected clustered graphs |
| ►Cogdf::LayoutModule | Interface of general layout algorithms |
| Cogdf::BalloonLayout | |
| Cogdf::BertaultLayout | |
| Cogdf::CircularLayout | The circular layout algorithm |
| Cogdf::ComponentSplitterLayout | |
| Cogdf::DavidsonHarelLayout | The Davidson-Harel layout algorithm |
| Cogdf::DominanceLayout | |
| Cogdf::DTreeMultilevelEmbedder2D | |
| Cogdf::DTreeMultilevelEmbedder3D | |
| Cogdf::FastMultipoleEmbedder | The fast multipole embedder approach for force-directed layout |
| Cogdf::FastMultipoleMultilevelEmbedder | The fast multipole multilevel embedder approach for force-directed multilevel layout |
| Cogdf::FMMMLayout | The fast multipole multilevel layout algorithm |
| ►Cogdf::ForceLayoutModule | Interface of general layout algorithms |
| Cogdf::SpringEmbedderFRExact | Fruchterman-Reingold algorithm with (exact) layout |
| Cogdf::GEMLayout | The energy-based GEM layout algorithm |
| Cogdf::GeometricEdgeInsertion | |
| Cogdf::GeometricVertexInsertion | |
| ►Cogdf::GridLayoutModule | Base class for grid layout algorithms |
| ►Cogdf::PlanarGridLayoutModule | Base class for planar grid layout algorithms |
| Cogdf::FPPLayout | The class FPPLayout represents the layout algorithm by de Fraysseix, Pach, Pollack [DPP90] |
| ►Cogdf::GridLayoutPlanRepModule | Base class for grid layout algorithms operating on a PlanRep |
| Cogdf::MixedModelLayout | Implementation of the Mixed-Model layout algorithm |
| Cogdf::PlanarDrawLayout | Implementation of the Planar-Draw layout algorithm |
| Cogdf::PlanarStraightLayout | Implementation of the Planar-Straight layout algorithm |
| Cogdf::SchnyderLayout | The class SchnyderLayout represents the layout algorithm by Schnyder [Sch90] |
| Cogdf::PlanarizationGridLayout | The planarization grid layout algorithm |
| Cogdf::LinearLayout | Layout the graph with nodes next to each other with natural or custom order and draw the edges as semicircular bows above them |
| Cogdf::ModularMultilevelMixer | Modular multilevel graph layout |
| Cogdf::MultilevelLayout | The multilevel drawing framework |
| ►Cogdf::MultilevelLayoutModule | Interface of general layout algorithms that also allow a MultilevelGraph as call parameter, extending the interface of a simple LayoutModule |
| Cogdf::PreprocessorLayout | The PreprocessorLayout removes multi-edges and self-loops |
| Cogdf::ScalingLayout | Scales a graph layout and calls a secondary layout algorithm |
| Cogdf::NodeRespecterLayout | The NodeRespecterLayout layout algorithm |
| Cogdf::PivotMDS | The Pivot MDS (multi-dimensional scaling) layout algorithm |
| Cogdf::PlanarizationLayout | The planarization approach for drawing graphs |
| Cogdf::ProcrustesSubLayout | Simple procrustes analysis |
| Cogdf::RadialTreeLayout | The radial tree layout algorithm |
| Cogdf::SimpleCCPacker | Splits and packs the components of a Graph |
| ►Cogdf::spring_embedder::SpringEmbedderBase | Common base class for ogdf::SpringEmbedderBase and ogdf::SpringEmbedderGridVariant |
| Cogdf::SpringEmbedderGridVariant | The spring-embedder layout algorithm with force approximation using hte grid variant approach |
| Cogdf::SpringEmbedderKK | The spring-embedder layout algorithm by Kamada and Kawai |
| Cogdf::StressMinimization | Energy-based layout using stress minimization |
| Cogdf::SugiyamaLayout | Sugiyama's layout algorithm |
| Cogdf::TreeLayout | The tree layout algorithm |
| Cogdf::TutteLayout | Tutte's layout algorithm |
| Cogdf::UpwardPlanarizationLayout | |
| Cogdf::VertexMovement | |
| Cogdf::VisibilityLayout | |
| ►Cogdf::LayoutPlanRepModule | Interface for planar layout algorithms (used in the planarization approach) |
| Cogdf::OrthoLayout | The Orthogonal layout algorithm for planar graphs |
| ►Cogdf::LayoutPlanRepUMLModule | Interface for planar UML layout algorithms |
| Cogdf::OrthoLayoutUML | Represents planar orthogonal drawing algorithm for mixed-upward planar embedded graphs (UML-diagrams) |
| Cogdf::LayoutStandards | Standard values for graphical attributes and layouts |
| Cogdf::LayoutStatistics | Computes statistical information about a layout |
| Cogdf::LCA | Implements 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::LevelBase | Representation of levels in hierarchies |
| Cogdf::ArrayLevel | The simple implementation of LevelBase interface |
| Cogdf::Level | Representation of levels in hierarchies |
| Cogdf::LHTreeNode | |
| Cogdf::LHTreeNode::Adjacency | |
| Cogdf::LHTreeNode::ClusterCrossing | |
| ►Cogdf::List< E > | Doubly linked lists (maintaining the length of the list) |
| Cogdf::ListContainer< E, Master > | |
| 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::Logger | Centralized global and local logging facility working on streams like std::cout |
| ►Cogdf::MatchingModule< TWeight > | |
| Cogdf::MatchingBlossom< TWeight > | Implementation of the Blossom-I algorithm by Edmonds (1965) for Minimum Weight Perfect Matching |
| Cogdf::MinimumCutNagamochiIbaraki | Calculate minimum cut value for a given Graph |
| Cogdf::MinSteinerTreeDirectedCut< T >::Master | Master problem of Steiner tree branch&cut algorithm |
| Cogdf::SubgraphPlanarizer | The planarization approach for crossing minimization |
| Cogdf::SubgraphPlanarizerUML | The planarization approach for UML crossing minimization |
| Cogdf::Logger::Indent | |
| Cogdf::LongestPathCompaction | Compaction algorithm using longest paths in the constraint graph |
| Cogdf::LPSolver | |
| Cogdf::MallocMemoryAllocator | Implements a simple memory manager using malloc() and free() |
| Cogdf::MallocMemoryAllocator::MemElem | |
| Cogdf::matching_blossom::AlternatingTree< TWeight > | |
| Cogdf::matching_blossom::AuxEdge< TWeight > | |
| Cogdf::matching_blossom::AuxGraph< TWeight > | |
| Cogdf::matching_blossom::AuxNode< TWeight > | |
| ►Cogdf::matching_blossom::BaseIteratorContainer< Iterator, Key, Value > | Dummy class for scoped iteration of a std::unordered_map |
| Cogdf::matching_blossom::BlossomPQ< edge, TWeight > | |
| Cogdf::matching_blossom::BlossomPQ< node, TWeight > | |
| Cogdf::matching_blossom::BlossomPQ< E, TWeight, C, Impl > | A custom priority queue for the blossom algorithm, based on the PrioritizedMapQueue. It uses a std::unordered_map to store the handles, handles merge operations correctly, can iterate over its elements and offers a remove() function |
| Cogdf::matching_blossom::BlossomHelper< TWeight > | Helper class for the blossom matching algorithms |
| Cogdf::matching_blossom::BlossomVHelper< TWeight > | Helper class for the blossom matching algorithms |
| Cogdf::matching_blossom::Cycle | |
| Cogdf::matching_blossom::Pseudonode | Helper class representing a pseudonode in the Blossom algorithm |
| Cogdf::matching_blossom::Pseudonode::ReferenceEdges | Helper class to store reference edges for all self loops |
| Cogdf::MatchingBlossomV< TWeight > | Implementation of the Blossom-V algorithm by Kolmogorov (2009) for Minimum Weight Perfect Matching |
| Cogdf::MatchingBlossomV< TWeight >::stats | Structure to store statistics |
| Cogdf::MaxAdjOrdering | Calculate 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 > | Computes a min-cost flow using a network simplex method |
| Cogdf::MinCostFlowReinelt< TCost >::arctype | |
| Cogdf::MinCostFlowReinelt< TCost >::nodetype | |
| Cogdf::MinimumCutModule< T > | Serves as an interface for various methods to compute minimum cuts with or without edge weights |
| Cogdf::MinimumCutNagamochiIbaraki::adjInfo | |
| Cogdf::MinimumCutNagamochiIbaraki::BoundedList | |
| Cogdf::MinimumCutNagamochiIbaraki::clusterstruct | |
| Cogdf::MinimumEdgeDistances< ATYPE > | Maintains input sizes for improvement compaction (deltas and epsilons) |
| Cogdf::MinimumEdgeDistances< ATYPE >::InfoType | |
| ►Cogdf::MinSTCutModule< TCost > | |
| Cogdf::MinSTCutBFS< TCost > | Min-st-cut algorithm, that calculates the cut by doing a depth first search over the dual graph of of an st-planar input graph |
| Cogdf::MinSTCutDijkstra< TCost > | Min-st-cut algorithm, that calculates the cut by calculating the shortest path between the faces adjacent to an edge between s and t, via the algorithm by Dijkstra on the dual graph |
| Cogdf::MinSTCutMaxFlow< TCost > | Min-st-cut algorithm, that calculates the cut via maxflow |
| Cogdf::MinSteinerTreeGoemans139< T >::Main | Class managing LP-based approximation |
| Cogdf::MinSteinerTreeMehlhorn< T >::MehlhornTriple | Represents 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::MinSteinerTreeDirectedCut< T > | This class implements the Directed Cut Integer Linear Program for the Steiner tree problem |
| Cogdf::MinSteinerTreeDualAscent< T > | Dual ascent heuristic for the minimum Steiner tree problem |
| Cogdf::MinSteinerTreeGoemans139< T > | This class implements the (1.39+epsilon)-approximation algorithm for the Steiner tree problem by Goemans et |
| Cogdf::MinSteinerTreeKou< T > | This class implements the Minimum Steiner Tree 2-approximation algorithm by Kou et al |
| Cogdf::MinSteinerTreeMehlhorn< T > | This class implements the Minimum Steiner Tree 2-approximation algorithm by Mehlhorn |
| Cogdf::MinSteinerTreePrimalDual< T > | Primal-Dual approximation algorithm for Steiner tree problems |
| Cogdf::MinSteinerTreeRZLoss< T > | This class implements the loss-contracting (1.55+epsilon)-approximation algorithm for the Steiner tree problem by Robins and Zelikovsky |
| Cogdf::MinSteinerTreeShore< T > | Implementation of Shore, Foulds and Gibbons exact branch and bound algorithm for solving Steiner tree problems |
| Cogdf::MinSteinerTreeTakahashi< T > | This class implements the minimum Steiner tree 2-approximation algorithm by Takahashi and Matsuyama with improvements proposed by Poggi de Aragao et al |
| Cogdf::MinSteinerTreeZelikovsky< T > | This class implements the 11/6-approximation algorithm by Zelikovsky for the minimum Steiner tree problem along with variants and practical improvements |
| Cogdf::MinSteinerTreeRZLoss< T >::Main | |
| Cogdf::MixedModelBase | |
| ►Cogdf::MixedModelCrossingsBeautifierModule | The base class for Mixed-Model crossings beautifier algorithms |
| ►Cogdf::MMCBBase | Common base class for MMCBDoubleGrid and MMCBLocalStretch |
| Cogdf::MMCBDoubleGrid | Crossings beautifier using grid doubling |
| Cogdf::MMCBLocalStretch | Crossings beautifier using a local stretch strategy |
| Cogdf::MMDummyCrossingsBeautifier | Dummy implementation of Mixed-Model crossings beautifier |
| Cogdf::MMOrder | |
| Cogdf::MMVariableEmbeddingInserter::AnchorNodeInfo | |
| Cogdf::MMVariableEmbeddingInserter::Paths | |
| Cogdf::ModifiedNibbleClusterer | The modified nibble clustering algorithm |
| ►Cogdf::Module | Base class for modules |
| ►Cogdf::ClusterPlanarityModule | |
| Cogdf::CconnectClusterPlanarityModule | |
| Cogdf::HananiTutteCPlanarity | C-planarity testing via Hanani-Tutte approach |
| Cogdf::ILPClusterPlanarity | C-planarity testing via completely connected graph extension |
| Cogdf::SyncPlanClusterPlanarityModule | ClusterPlanarity testing in quadratic time using the Synchronized Planarity approach |
| ►Cogdf::CPlanarSubgraphModule | Interface of algorithms for the computation of c-planar subgraphs |
| Cogdf::MaximumCPlanarSubgraph | Exact computation of a maximum c-planar subgraph |
| ►Cogdf::CrossingMinimizationModule | Base class for crossing minimization algorithms |
| Cogdf::PlanarizerChordlessCycle | |
| Cogdf::PlanarizerMixedInsertion | |
| Cogdf::PlanarizerStarReinsertion | The star (re-)insertion approach for crossing minimization |
| Cogdf::SubgraphPlanarizer | The planarization approach for crossing minimization |
| ►Cogdf::EdgeInsertionModule | Interface for edge insertion algorithms |
| Cogdf::FixedEmbeddingInserter | Inserts edges optimally into an embedding |
| Cogdf::MultiEdgeApproxInserter | Multi edge inserter with approximation guarantee |
| ►Cogdf::VariableEmbeddingInserterBase | Common parameter functionality for ogdf::VariableEmbeddingInserter and ogdf::VariableEmbeddingInserterDyn |
| Cogdf::VariableEmbeddingInserter | Optimal edge insertion module |
| Cogdf::VariableEmbeddingInserterDyn | Optimal edge insertion module |
| ►Cogdf::EmbedderModule | Base class for embedder algorithms |
| ►Cogdf::embedder::EmbedderBCTreeBase< false > | |
| ►Cogdf::EmbedderMaxFace | Embedder that maximizes the external face |
| ►Cogdf::embedder::LayersBlockEmbedder< EmbedderMaxFace, int > | |
| Cogdf::EmbedderMaxFaceLayers | Embedder that maximizes the external face and optimizes the position of blocks afterwards |
| ►Cogdf::EmbedderMinDepthMaxFace | Embedding that minimizes block-nesting depth and maximizes the external face |
| ►Cogdf::embedder::LayersBlockEmbedder< EmbedderMinDepthMaxFace, embedder::MDMFLengthAttribute > | |
| Cogdf::EmbedderMinDepthMaxFaceLayers | Planar graph embedding that minimizes block-nesting depth and maximizes the external face and optimizes the position of blocks afterwards |
| Cogdf::EmbedderMinDepthPiTa | Embedder that minimizes block-nesting depth for given embedded blocks |
| ►Cogdf::embedder::EmbedderBCTreeBase< false, true > | |
| Cogdf::EmbedderMinDepth | Embedder that minimizes block-nesting depth |
| Cogdf::embedder::EmbedderBCTreeBase< EnableLayers, IsEmbedderMinDepth > | Common base for embedder algorithms based on BC trees |
| Cogdf::EmbedderOptimalFlexDraw | The algorithm computes a planar embedding with minimum cost |
| Cogdf::SimpleEmbedder | Embedder that chooses a largest face as the external one |
| ►Cogdf::FUPSModule | Interface for feasible upward planar subgraph algorithms |
| Cogdf::FUPSSimple | |
| Cogdf::MaximalFUPS | |
| Cogdf::MatchingModule< TWeight > | |
| ►Cogdf::MMCrossingMinimizationModule | Interface for minor-monotone crossing minimization algorithms |
| Cogdf::MMSubgraphPlanarizer | Planarization approach for minor-monotone crossing minimization |
| ►Cogdf::MMEdgeInsertionModule | Interface for minor-monotone edge insertion algorithms |
| Cogdf::MMFixedEmbeddingInserter | Minor-monotone edge insertion with fixed embedding |
| Cogdf::MMVariableEmbeddingInserter | Minor-monotone edge insertion with variable embedding |
| ►Cogdf::PlanarSubgraphModule< TCost > | Interface for planar subgraph algorithms |
| Cogdf::MaximalPlanarSubgraphSimple< TCost, typename std::enable_if< std::is_floating_point< TCost >::value >::type > | |
| Cogdf::MaximalPlanarSubgraphSimple< TCost, typename std::enable_if< std::is_integral< TCost >::value >::type > | Naive maximal planar subgraph approach that extends a configurable non-maximal subgraph heuristic |
| Cogdf::MaximumPlanarSubgraph< TCost > | Exact computation of a maximum planar subgraph |
| Cogdf::PlanarSubgraphEmpty< TCost > | Dummy implementation for maximum planar subgraph that returns an empty graph |
| Cogdf::PlanarSubgraphFast< TCost > | Computation of a planar subgraph using PQ-trees |
| Cogdf::PlanarSubgraphTree< TCost > | Maximum planar subgraph heuristic that yields a spanning tree |
| ►Cogdf::PlanarSubgraphTriangles< TCost > | Maximum planar subgraph approximation algorithms by Chalermsook/Schmid and Calinescu et al |
| Cogdf::PlanarSubgraphCactus< TCost > | Maximum planar subgraph approximation algorithm by Calinescu et al |
| ►Cogdf::SpannerModule< TWeight > | Interface for spanner algorithms |
| Cogdf::SpannerBasicGreedy< TWeight > | Multiplicative spanner by greedily adding edges |
| Cogdf::SpannerBaswanaSen< TWeight > | Randomized multiplicative spanner calculation by forming clusters |
| Cogdf::SpannerBerman< TWeight > | Approximation algorithm for calculating spanners |
| Cogdf::SpannerBermanDisconnected< TWeight > | Wrapper around SpannerBerman: For each component of the graph, the algorithm will be called |
| Cogdf::SpannerElkinNeiman< TWeight > | Randomized multiplicative spanner calculation by propagating random messages through the graph |
| ►Cogdf::SpannerIteratedWrapper< TWeight > | A implementation-independed wrapper class to execute a spanner algorithm multiple times |
| Cogdf::SpannerBaswanaSenIterated< TWeight > | Use the ogdf::SpannerIteratedWrapper to execute the ogdf::SpannerBaswanaSen algorithm up to 1000 times |
| Cogdf::SpannerElkinNeimanIterated< TWeight > | Use the ogdf::SpannerIteratedWrapper to execute the ogdf::SpannerElkinNeiman algorithm up to 200 times |
| Cogdf::SpannerKortsarzPeleg< TWeight > | Approximation multiplicative 2-spanner calculation |
| ►Cogdf::UMLCrossingMinimizationModule | Base class for UML crossing minimization algorithms |
| Cogdf::SubgraphPlanarizerUML | The planarization approach for UML crossing minimization |
| ►Cogdf::UMLEdgeInsertionModule | Interface for UML edge insertion algorithms |
| Cogdf::FixedEmbeddingInserterUML | Edge insertion module that inserts each edge optimally into a fixed embedding |
| Cogdf::VariableEmbeddingInserterDynUML | Optimal edge insertion module |
| Cogdf::VariableEmbeddingInserterUML | Optimal edge insertion module |
| ►Cogdf::UpwardEdgeInserterModule | |
| Cogdf::FixedEmbeddingUpwardEdgeInserter | Edge insertion module that inserts each edge optimally into a fixed embedding |
| ►Cogdf::UpwardPlanarizerModule | Interface for upward planarization algorithms |
| Cogdf::SubgraphUpwardPlanarizer | Takes an acyclic connected non-upward-planar graph and planarizes it, i.e., we obtain an upward-planar graph where crossings are represented via dummy vertices |
| ►Cogdf::PlanarSubgraphModule< int > | |
| Cogdf::PlanarSubgraphBoyerMyrvold | Maximum planar subgraph heuristic based on the Boyer-Myrvold planarity test |
| Cogdf::MultiEdgeApproxInserter::VertexBlock | |
| ►Cogdf::MultilevelBuilder | Base class for merger modules |
| Cogdf::EdgeCoverMerger | The edge cover merger for multilevel layout |
| Cogdf::IndependentSetMerger | The independent set merger for multilevel layout |
| Cogdf::LocalBiconnectedMerger | The local biconnected merger for multilevel layout |
| Cogdf::MatchingMerger | The matching merger for multilevel layout |
| Cogdf::RandomMerger | The random merger for multilevel layout |
| Cogdf::SolarMerger | The solar merger for multilevel layout |
| Cogdf::MultilevelGraph | |
| Cogdf::NearestRectangleFinder | Finds in a given set of rectangles for each point in a given set of points the nearest rectangle |
| Cogdf::NearestRectangleFinder::PairRectDist | Represents a rectangle (given by its index) and a distance value |
| Cogdf::NearestRectangleFinder::RectRegion | Represents a rectangle given by center point, width and height |
| ►Cogdf::NodeColoringModule | Approximation algorithms for the node coloring problem in graphs |
| Cogdf::NodeColoringBergerRompel | Approximation algorithms for the node coloring problem in graphs |
| Cogdf::NodeColoringBoppanaHalldorsson | Approximation algorithms for the node coloring problem in graphs |
| Cogdf::NodeColoringHalldorsson | Approximation algorithms for the node coloring problem in graphs |
| Cogdf::NodeColoringJohnson | Approximation algorithms for the node coloring problem in graphs |
| Cogdf::NodeColoringRecursiveLargestFirst | A simple greedy node coloring heuristic in graphs |
| Cogdf::NodeColoringSequential | Approximation algorithms for the node coloring problem in graphs |
| Cogdf::NodeColoringSimple | Approximation algorithms for the node coloring problem in graphs |
| Cogdf::NodeColoringWigderson | Approximation algorithms for the node coloring problem in graphs |
| ►Cogdf::NodeColoringModule::SearchWrapper | Wraps the search for the minimum parameter k so that the same code can be reused for all algorithms |
| Cogdf::NodeColoringBergerRompel::SearchWrapperBergerRompel | Wraps the parameterized Berger&Rompel algorithm |
| Cogdf::NodeColoringHalldorsson::SearchWrapperHalldorsson | Wraps the recursive Halldórsson algorithm |
| Cogdf::NodeColoringWigderson::SearchWrapperWigderson | Wraps the Wigderson recursive algorithm |
| Cogdf::NodeColoringModule::SubsetIterator | Struct to iterate over all node subsets of a given size |
| Cogdf::NodeColoringSequential::NodeDegreeComparer | Class for comparing two nodes by the node degree |
| Cogdf::NodeMerge | |
| Cogdf::NodePair | |
| Cogdf::NonPlanarCore< TCost > | Non-planar core reduction |
| Cogdf::NonPlanarCore< TCost >::CutEdge | Struct to represent an edge that needs to be crossed in order to cross an st-component |
| Cogdf::Observable< TObserver, TObserved > | Base class for an observable object that can be tracked by multiple Observer objects |
| Cogdf::Observer< TObserved, TObserver > | Base class for an observer for a single Observable object |
| Cogdf::OGDFAllocator< T > | Encapsulates OGDF_ALLOCATOR in a class that can be used as the Allocator for containers of the C++ standard library |
| Cogdf::OrderComparer | |
| Cogdf::OrthoRep | Orthogonal representation of an embedded graph |
| Cogdf::OrthoRep::SideInfoUML | Information about a side of a vertex in UML diagrams |
| Cogdf::OrthoRep::VertexInfoUML | Further information about the cages of vertices in UML diagrams |
| Cogdf::OrthoShaper | |
| Cogdf::OverlappingGraphCopies | The manager class for multiple OverlappingGraphCopy instances of the same graph |
| Cogdf::PairingHeapNode< T > | Pairing heap node |
| Cogdf::PALabel | Auxiliary class for the planar augmentation algorithm |
| Cogdf::pc_tree::FilteringPCTreeWalk< dfs, reverse > | A DFS or BFS through a PCTree |
| Cogdf::pc_tree::IntrusiveList< T > | |
| Cogdf::pc_tree::IntrusiveList< T >::iterator | |
| ►Cogdf::pc_tree::IntrusiveList< T >::node | |
| Cogdf::pc_tree::PCNode | A node in a PC-tree that is either a P-node, C-node or leaf |
| Cogdf::pc_tree::PCNode::TempInfo | Temporary information used during each step of the PCTree::makeConsecutive() update operation |
| Cogdf::pc_tree::PCNodeChildrenIterable | |
| Cogdf::pc_tree::PCNodeIterator | |
| Cogdf::pc_tree::PCNodeNeighborsIterable | |
| ►Cogdf::pc_tree::PCTree | A PC-tree represents a set of cyclic orders of its leaves by labeling its inner nodes as either P- or C-node and allowing arbitrary permutations of the neighbors of P-nodes while only allowing flips of C-nodes |
| ►Cogdf::pc_tree::NodePCRotation | This class represents the embedding tree of a single node in a biconnected component |
| Cogdf::sync_plan::NodeSPQRRotation | Derive embedding trees from an DynamicSPQRForest. Warning: breaks on certain parallel edge configurations! |
| Cogdf::sync_plan::NodeSSPQRRotation | Derive embedding trees from Triconnectivity information |
| Cogdf::pc_tree::PCTree::NextFullLeaf< It > | |
| ►Cogdf::pc_tree::PCTree::Observer | Interface for Observers that can be notified of all changes made to the tree during an update |
| Cogdf::pc_tree::PCTree::LoggingObserver | |
| Cogdf::pc_tree::PCTreeForest | Multiple PCTrees can be created within the same PCTreeForest, which allows merging the trees later on by making one a child of another |
| Cogdf::PertinentGraph | Pertinent graphs of nodes in an SPQR-tree |
| ►Cogdf::planar_separators::BFSTree | Abstract description of a Breadth First Search tree |
| ►Cogdf::planar_separators::ArrayBFSTree | Abstract BFSTree that is realized via NodeArrays |
| Cogdf::planar_separators::BFSTreeClassical | BFS tree used by both classical algorithms (LT and Dual) |
| Cogdf::planar_separators::BFSTreeFC | Custom BFS Tree |
| Cogdf::planar_separators::BFSTreeHP | Specialised tree representation for Har-Peled |
| Cogdf::planar_separators::TriangulatingBFSTree | Triangulating BFS tree that operates on a non-triangulated graph and constructs the triangulation together with the BFS, which should lead to broader trees |
| Cogdf::planar_separators::Cycle | Auxiliary data structure to represent Cycles in planar graphs |
| Cogdf::planar_separators::Cycle::Iterator | Special iterator to walk over the inward-pointing edges of the cycle |
| ►Cogdf::planar_separators::Postprocessor | Abstract description of postprocessors |
| Cogdf::planar_separators::DMDecomposer | Dulmage-Mendelsohn-Decomposition |
| Cogdf::planar_separators::NodeExpulsor | NodeExpulsor: Remove all nodes that are not connected to both halves of the separation |
| Cogdf::planar_separators::Ring | A closed ring of nodes |
| Cogdf::planar_separators::SeparatorDualHelper | Helper class for SeparatorDual and SeparatorDualFC |
| Cogdf::planar_separators::SeparatorDualHelper::CycleData | Auxiliary lightweight data structure to represent cycles |
| ►Cogdf::PlanarityModule | Module for planarity testing and planar embeddings |
| Cogdf::BoothLueker | Booth-Lueker planarity test |
| Cogdf::BoyerMyrvold | Wrapper class used for preprocessing and valid invocation of the planarity test |
| Cogdf::planarization_layout::CliqueReplacer | |
| ►Cogdf::PlanarSeparatorModule | Abstract description of all planar separator algorithms |
| Cogdf::SeparatorHarPeled | Computes planar separators according to Har-Peled |
| ►Cogdf::SeparatorLiptonTarjan | Computes planar separators according to Lipton and Tarjan 1979 |
| Cogdf::SeparatorDual | Computes planar separators using the Dual of the graph |
| ►Cogdf::SeparatorLiptonTarjanFC | Computes planar separators using Fundamental Cycles |
| Cogdf::SeparatorDualFC | Computes planar separators by applying the Fundamental Cycle Lemma directly, without trying tree levels first |
| Cogdf::PlanarSubgraphFast< TCost >::ThreadMaster | |
| Cogdf::PlanarSubgraphFast< TCost >::Worker | |
| Cogdf::PlanRep::Deg1RestoreInfo | Information for restoring degree-1 nodes |
| Cogdf::PlanRepExpansion::Crossing | |
| Cogdf::PlanRepExpansion::NodeSplit | Representation of a node split in a planarized expansion |
| Cogdf::PoolMemoryAllocator | Allocates memory in large chunks for better runtime |
| Cogdf::PoolMemoryAllocator::MemElem | Basic 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::PQBasicKeyRoot | The class PQBasicKeyRoot is used as a base class of the class template basicKey |
| ►Cogdf::PQBasicKey< T, X, Y > | |
| Cogdf::PQInternalKey< T, X, Y > | The class template PQInternalKey is a derived class of class template PQBasicKey |
| Cogdf::PQLeafKey< T, X, Y > | The class template PQLeafKey is a derived class of class template PQBasicKey |
| ►Cogdf::PQNode< T, X, Y > | The class template PQBasicKey is an abstract base class |
| Cogdf::PQInternalNode< T, X, Y > | The class template PQInternalNode is used to present P-nodes and Q-nodes in the PQ-Tree |
| Cogdf::PQLeaf< T, X, Y > | The datastructure PQ-tree was designed to present a set of permutations on an arbitrary set of elements |
| Cogdf::PQNodeKey< T, X, Y > | The class template PQNodeKey is a derived class of class template PQBasicKey |
| Cogdf::PQNodeRoot | The class PQNodeRoot is used as a base class of the class PQNode |
| Cogdf::PQTree< T, X, Y > | |
| Cogdf::PreprocessorLayout::EdgeData | Deleted 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::pq_internal::PrioritizedQueue< E, P, C, Impl > | Defines a queue for handling prioritized elements |
| Cogdf::matching_blossom::BlossomPQ< edge, TWeight > | |
| Cogdf::matching_blossom::BlossomPQ< node, TWeight > | |
| Cogdf::matching_blossom::BlossomPQ< E, TWeight, C, Impl > | A custom priority queue for the blossom algorithm, based on the PrioritizedMapQueue. It uses a std::unordered_map to store the handles, handles merge operations correctly, can iterate over its elements and offers a remove() function |
| Cogdf::pq_internal::PrioritizedArrayQueueBase< E, P, C, Impl, Map > | |
| ►Cogdf::pq_internal::PrioritizedQueue< E, P, std::less< P >, PairingHeap > | |
| ►Cogdf::pq_internal::PrioritizedArrayQueueBase< E, P, std::less< P >, PairingHeap, HashArray< E, PrioritizedQueue< E, P, std::less< P >, PairingHeap >::Handle, DefHashFunc< E > > > | |
| Cogdf::PrioritizedMapQueue< E, P, C, Impl, HashFunc > | Prioritized queue interface wrapper for heaps |
| ►Cogdf::pq_internal::PrioritizedQueue< edge, P, C, Impl > | |
| ►Cogdf::pq_internal::PrioritizedArrayQueueBase< edge, P, C, Impl, EdgeArray< PrioritizedQueue< edge, P, C, Impl >::Handle > > | |
| Cogdf::PrioritizedMapQueue< edge, P, C, Impl, HashFunc > | Specialization for edge elements |
| Cogdf::pq_internal::PrioritizedQueue< Node, double > | |
| ►Cogdf::pq_internal::PrioritizedQueue< node, P, C, Impl > | |
| ►Cogdf::pq_internal::PrioritizedArrayQueueBase< node, P, C, Impl, NodeArray< PrioritizedQueue< node, P, C, Impl >::Handle > > | |
| Cogdf::PrioritizedMapQueue< node, P, C, Impl, HashFunc > | Specialization for node elements |
| ►Cogdf::pq_internal::PrioritizedQueue< ogdf::EdgeElement, TCap, std::less< TCap >, PairingHeap > | |
| ►Cogdf::pq_internal::PrioritizedArrayQueueBase< ogdf::EdgeElement, TCap, std::less< TCap >, PairingHeap, HashArray< ogdf::EdgeElement, PrioritizedQueue< ogdf::EdgeElement, TCap, std::less< TCap >, PairingHeap >::Handle, DefHashFunc< ogdf::EdgeElement > > > | |
| Cogdf::PrioritizedMapQueue< ogdf::EdgeElement, TCap > | |
| Cogdf::ProcrustesPointSet | |
| Cogdf::QueueEntry | |
| Cogdf::RadixHeap< V, P > | Radix heap data structure implementation |
| Cogdf::RadixHeapNode< V, P > | |
| Cogdf::RandomClusterConfig | Parameters for the randomPlanarClustering() method |
| Cogdf::Range< IT > | Simple before-C++20 version for std::ranges::ref_view |
| ►Cogdf::RankingModule | Interface of algorithms for computing a node ranking |
| Cogdf::CoffmanGrahamRanking | The coffman graham ranking algorithm |
| Cogdf::LongestPathRanking | The longest-path ranking algorithm |
| Cogdf::OptimalRanking | The optimal ranking algorithm |
| Cogdf::RCCrossings | |
| Cogdf::RegisteredArrayIterator< ArrayType, KeyIterator, isConst > | Iterator for registered arrays |
| Cogdf::RegisteredMultiArray< Key1, Key2, Value, BaseArray, array_max > | Data structure for two-dimensional mappings that are sparse in the second dimension |
| Cogdf::RegisteredSet< Registry, SupportFastSizeQuery > | Constant-time set operations |
| ►Cogdf::RegistryBase< Key, Registry, Iterator > | Abstract base class for registries |
| Cogdf::ClusterGraph | Representation of clustered graphs |
| ►Cogdf::ConstCombinatorialEmbedding | Combinatorial embeddings of planar graphs |
| Cogdf::CombinatorialEmbedding | Combinatorial embeddings of planar graphs with modification functionality |
| 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::ShellingOrder | The shelling order of a graph |
| ►Cogdf::ShellingOrderModule | Base class for modules that compute a shelling order of a graph |
| Cogdf::BiconnectedShellingOrder | Computation of the shelling order for biconnected graphs |
| Cogdf::TriconnectedShellingOrder | Computation of a shelling order for a triconnected and simple (no multi-edges, no self-loops) planar graph |
| ►Cogdf::ShortestPathModule | |
| Cogdf::ShortestPathWithBFM | Computes single-source shortest-paths with Bellman-Ford-Moore's algorithm |
| Cogdf::SimDraw | The Base class for simultaneous graph drawing |
| Cogdf::SimDrawColorizer::SimDrawColorScheme | Manages the various color schemes |
| ►Cogdf::SimDrawManipulatorModule | Interface for simdraw manipulators |
| Cogdf::SimDrawCaller | Calls modified algorithms for simdraw instances |
| Cogdf::SimDrawColorizer | Adds color to a graph |
| ►Cogdf::SimDrawCreator | Creates variety of possible SimDraw creations |
| Cogdf::SimDrawCreatorSimple | Offers predefined SimDraw creations |
| Cogdf::SimpleCluster | |
| ►Cogdf::Skeleton | Skeleton graphs of nodes in an SPQR-tree |
| Cogdf::DynamicSkeleton | Skeleton graphs of nodes in a dynamic SPQR-tree |
| Cogdf::StaticSkeleton | Skeleton graphs of nodes in a static SPQR-tree |
| Cogdf::Skiplist< X > | A randomized skiplist |
| Cogdf::Skiplist< X >::Element | Internal 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::QueuePure< E > | Implementation of list-based queues |
| ►Cogdf::SList< E > | Singly linked lists (maintaining the length of the list) |
| Cogdf::Queue< E > | The parameterized class Queue<E> implements list-based queues |
| Cogdf::SolarMerger::PathData | |
| Cogdf::SortedSequence< KEY, INFO, CMP > | Maintains a sequence of (key,info) pairs sorted by key |
| Cogdf::SortedSequence< KEY, INFO, CMP >::Element | Internal 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::SpannerBasicGreedy< TWeight >::EdgeWeightComparator | |
| Cogdf::SpannerElkinNeiman< TWeight >::BfsNode | |
| Cogdf::SpannerModule< TWeight >::TimeoutException | |
| ►Cogdf::SPQRTree | Linear-time implementation of static SPQR-trees |
| Cogdf::DynamicSPQRTree | Linear-time implementation of dynamic SPQR-trees |
| ►Cogdf::PlanarSPQRTree | SPQR-trees of planar graphs |
| Cogdf::DynamicPlanarSPQRTree | SPQR-trees of planar graphs |
| Cogdf::StaticPlanarSPQRTree | SPQR-trees of planar graphs |
| ►Cogdf::StaticSPQRTree | Linear-time implementation of static SPQR-trees |
| Cogdf::StaticPlanarSPQRTree | SPQR-trees of planar graphs |
| ►Cogdf::spring_embedder::CommonForceModelBase< NodeInfo > | |
| ►Cogdf::SpringEmbedderGridVariant::ForceModelBase | |
| Cogdf::SpringEmbedderGridVariant::ForceModelEades | |
| Cogdf::SpringEmbedderGridVariant::ForceModelFR | |
| Cogdf::SpringEmbedderGridVariant::ForceModelFRModAttr | |
| Cogdf::SpringEmbedderGridVariant::ForceModelFRModRep | |
| Cogdf::SpringEmbedderGridVariant::ForceModelGronemann | |
| Cogdf::SpringEmbedderGridVariant::ForceModelHachul | |
| 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::ComplexDouble | Class to generate instrinsics for complex number arithmetic functions |
| Cogdf::StarInserter | |
| 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::Full3ComponentGeneratorEnumeration< T > | Full 3-component generation using enumeration |
| Cogdf::steiner_tree::Full3ComponentGeneratorVoronoi< T > | Full 3-component generation using Voronoi regions |
| Cogdf::steiner_tree::FullComponentDecisions | Contains rules of thumb to decide which (sub-)algorithms to use for the generation of full components |
| Cogdf::steiner_tree::FullComponentGeneratorCaller< T > | |
| 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 | Subgraphs (given by other subgraphs and additional node pairs) and their cost for a partial solution |
| Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagner< T >::DWMSplit | A collection of two subgraphs and their total cost |
| Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagner< T >::SortedNodeListHashFunc | |
| Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T > | A generator for restricted full components (for Steiner tree approximations) based on the Dreyfus-Wagner algorithm that does not need a precomputed all-pair-shortest-paths matrix because single-source-shortest-path are used within |
| Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::AuxiliaryGraph | Necessary because ogdf::EdgeWeightedGraphCopy<T> is rubbish |
| Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::DWMData | Subgraphs (given by other subgraphs and additional edges) and their cost for a partial solution |
| Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::DWMSplit | A collection of two subgraphs and their total cost |
| Cogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::SortedNodeListHashFunc | |
| ►Cogdf::steiner_tree::FullComponentStore< T, ExtraDataType > | A data structure to store full components |
| Cogdf::steiner_tree::FullComponentWithExtraStore< T, ExtraDataType > | A data structure to store full components with extra data for each component |
| 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::goemans::CoreEdgeRandomSpanningTree< T > | Computes a random set of core edges |
| Cogdf::steiner_tree::HeavyPathDecomposition< T > | An implementation of the heavy path decomposition on trees |
| Cogdf::steiner_tree::LossMetadata< T > | |
| Cogdf::steiner_tree::LowerBoundDualAscent< T > | Computes lower bounds for minimum Steiner tree instances |
| Cogdf::steiner_tree::LowerBoundDualAscent< T >::TerminalData | |
| Cogdf::steiner_tree::LowerBoundDualAscent< T >::TerminalDataReference | |
| 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::SaveDynamic< T > | Dynamically updatable weighted Tree for determining save edges via LCA computation |
| Cogdf::steiner_tree::SaveEnum< T > | This class computes save edges recursively and stores for every node pair their save edge in a HashArray |
| Cogdf::steiner_tree::SaveStatic< T > | This class behaves basically the same as SaveDynamic except that the update of the weighted graph is not done dynamically here |
| Cogdf::steiner_tree::Triple< T > | This class represents a triple used by various contraction-based minimum Steiner tree approximations |
| Cogdf::steiner_tree::UnorderedNodePairEquality | A class used by the unordered_maps inside the reductions |
| Cogdf::steiner_tree::UnorderedNodePairHasher | A class used by the unordered_maps inside the reductions |
| Cogdf::SteinerTreeLowerBoundDualAscent< T > | Implementation of a dual-ascent-based lower bound heuristic for Steiner tree problems |
| Cogdf::SteinerTreePreprocessing< T > | This class implements preprocessing strategies for the Steiner tree problem |
| 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::Stopwatch | Realizes a stopwatch for measuring elapsed time |
| Cogdf::StopwatchCPU | Implements a stopwatch measuring CPU time |
| Cogdf::StopwatchWallClock | Implements a stopwatch measuring wall-clock time |
| Cogdf::Stroke | Properties of strokes |
| Cogdf::SubsetEnumerator< T > | Enumerator for k-subsets of a given type |
| Cogdf::SvgPrinter | SVG Writer |
| Cogdf::sync_plan::BiconnectedIsolation | Hides all (edges leading to) adjacent biconnected components without changing the current embedding |
| Cogdf::sync_plan::internal::BlockEmbedding | Internal class used to embed a biconnected component with Q-vertices |
| Cogdf::sync_plan::internal::EncapsulatedBlock | Information on a single block adjacent to a cut-vertex that is about to be encapsulated |
| Cogdf::sync_plan::internal::FrozenSimplifyMapping | |
| Cogdf::sync_plan::internal::SimplifyMapping | |
| Cogdf::sync_plan::NodeSPQRRotation::RigidEmbedding | |
| Cogdf::sync_plan::Pipe | A pair of matched vertices of the same degree, whose rotation shall be synchronized |
| Cogdf::sync_plan::PipeCmpPtr< PipeCmp > | A null-safe and priority aware comparator (wrapper) for pipes |
| ►Cogdf::sync_plan::PipeQueue | A queue of all pipes, ordered by an arbitrary comparator function |
| Cogdf::sync_plan::SimplePipeQueue< PipeCmp > | PipeQueue CRTP base class for ordering pipes by some simple comparator function |
| ►Cogdf::sync_plan::SimplePipeQueue< PipeCmp1 > | |
| Cogdf::sync_plan::DoublePipeQueue< PipeCmp1, PipeCmp2 > | Base class for PipeQueues providing a "priority lane" for some pipes and sorting with different functions in both lanes/queues |
| ►Cogdf::sync_plan::SimplePipeQueue< PipeQueueByDegree > | |
| Cogdf::sync_plan::PipeQueueByDegree | PipeQueue yielding pipes in order of descending or ascending degree |
| ►Cogdf::sync_plan::SimplePipeQueue< PipeQueueByDegreePreferContract > | |
| ►Cogdf::sync_plan::DoublePipeQueue< PipeQueueByDegreePreferContract, PipeQueueByDegreePreferContract > | |
| Cogdf::sync_plan::PipeQueueByDegreePreferContract | PipeQueue yielding contractable pipes first (or last), in order of descending (or ascending) degree |
| ►Cogdf::sync_plan::SimplePipeQueue< PipeQueueRandom > | |
| Cogdf::sync_plan::PipeQueueRandom | PipeQueue yielding pipes in some random (but stable and deterministic) order |
| Cogdf::sync_plan::SimpleSPQRTree | Wrapper class around Triconnectivity information |
| Cogdf::sync_plan::SyncPlan | A class for modelling and solving Synchronized Planarity instances |
| ►Cogdf::sync_plan::SyncPlan::UndoOperation | The information needed for undoing the changes a specific operation made to the graph while maintaining its embedding |
| Cogdf::sync_plan::internal::UndoSimplify | |
| Cogdf::sync_plan::SyncPlan::ResetIndices | |
| Cogdf::sync_plan::SyncPlan::VerifyPipeBijections | |
| Cogdf::sync_plan::SyncPlanComponents | (Bi)Connected components information maintained during the SyncPlan algorithm |
| Cogdf::sync_plan::SyncPlanConsistency | Consistency checks for debugging the SyncPlan algorithm |
| Cogdf::sync_plan::SyncPlanDrawer | Utilities by dumping a drawing of the current state of a SyncPlan instance |
| Cogdf::System | System specific functionality |
| Cogdf::TargetComparer< CONTENTTYPE, STATICCONTENTCOMPARER > | A static comparer which compares the target of pointers ("content"), instead of the pointer's adresses |
| Cogdf::TikzWriter | LaTeX+TikZ Writer |
| Cogdf::TileToRowsCCPacker::RowInfo< POINT > | |
| ►Cogdf::Timeouter | Class for timeout funtionality |
| Cogdf::CPlanarSubgraphModule | Interface of algorithms for the computation of c-planar subgraphs |
| Cogdf::CrossingMinimizationModule | Base class for crossing minimization algorithms |
| Cogdf::EdgeInsertionModule | Interface for edge insertion algorithms |
| Cogdf::EmbedderModule | Base class for embedder algorithms |
| ►Cogdf::FixEdgeInserterCore | |
| Cogdf::FixEdgeInserterUMLCore | |
| Cogdf::PlanarSubgraphModule< TCost > | Interface for planar subgraph algorithms |
| Cogdf::UMLCrossingMinimizationModule | Base class for UML crossing minimization algorithms |
| Cogdf::UMLEdgeInsertionModule | Interface for UML edge insertion algorithms |
| ►Cogdf::VarEdgeInserterCore | |
| Cogdf::VarEdgeInserterUMLCore | |
| ►Cogdf::VarEdgeInserterDynCore | |
| Cogdf::VarEdgeInserterDynUMLCore | |
| Cogdf::PlanarSubgraphModule< int > | |
| Cogdf::tlp::Lexer | |
| Cogdf::tlp::Parser | |
| Cogdf::tlp::Token | |
| Cogdf::TokenIgnorer | |
| Cogdf::topology_module::EdgeLeg | Helper class for the computation of crossings |
| Cogdf::TopologyModule | Constructs embeddings from given layout |
| Cogdf::Triconnectivity | Realizes Hopcroft/Tarjan algorithm for finding the triconnected components of a biconnected multi-graph |
| Cogdf::Triconnectivity::CompStruct | Representation of a component |
| Cogdf::TsplibXmlParser | Parses tsplib files in xml format |
| Cogdf::Tuple2< E1, E2 > | Tuples of two elements (2-tuples) |
| Cogdf::twosat_var | In debug mode, twosat_var is a class instead of a simple int to prevent unintened use of the default 0-value instead of TwoSAT_Var_Undefined |
| Cogdf::UmlDiagramGraph | Contains the class UmlDiagramGraph which represents one particular diagram of the complete UML Model |
| Cogdf::UMLGraph::AssociationClass | Modelling of association classes |
| ►Cogdf::UMLLayoutModule | Interface of UML layout algorithms |
| Cogdf::PlanarizationLayoutUML | The planarization layout algorithm |
| ►Cogdf::UPRLayoutModule | Interface of hierarchy layout algorithms |
| Cogdf::LayerBasedUPRLayout | |
| Cogdf::UpSAT | |
| Cogdf::UpwardPlanarity | Upward planarity testing and embedding |
| Cogdf::UpwardPlanarityEmbeddedDigraph | |
| Cogdf::UpwardPlanaritySingleSource | Performs upward planarity testing and embedding for single-source digraphs |
| Cogdf::UpwardPlanaritySingleSource::DegreeInfo | |
| ►Cogdf::UpwardPlanarSubgraphModule | Interface for algorithms for computing an upward planar subgraph |
| Cogdf::UpwardPlanarSubgraphSimple | A maximal planar subgraph algorithm using planarity testing |
| Cogdf::UsuallySmallMap< Key2, Value, array_max > | A wrapper around std::map that uses a constant-size array (or only a single value) plus linear search until the map grows too big |
| Cogdf::VComparer< E > | Abstract base class for comparer classes |
| ►Cogdf::VertexPositionModule | Interface for computing a good / optimal vertex position |
| ►Cogdf::CrossingMinimalPosition< FT > | Compute a crossing minimal position for a vertex |
| Cogdf::CrossingMinimalPositionApx | |
| Cogdf::CrossingMinimalPositionApxWeighted | |
| Cogdf::RandomVertexPosition | Interface for computing a good / optimal vertex position |
| Cogdf::VisibilityLayout::EdgeSegment | |
| Cogdf::VisibilityLayout::NodeSegment | |
| Cogdf::Voronoi< T > | Computes Voronoi regions in an edge-weighted graph |
| Cogdf::WeightComparer< T > | |
| Cogdf::whaInfo | |
| Cogdf::WInfo | Saves information about a pertinent node w between two stopping vertices |
| Cogdf::ZipIterator< IT1, IT2 > | Simple before-C++20 version for std::ranges::zip_view |
| ►Cogdf::internal::gcm::graph::OGDFEntryIterator< adjEntry > | |
| Cogdf::internal::gcm::graph::AdjacentNodeIterator | |
| Cogdf::internal::gcm::graph::IncidentEdgeIterator | Iterate over incident edges |
| ►Cogdf::internal::gcm::graph::OGDFEntryIterator< Entry > | |
| Cogdf::internal::gcm::graph::EntryIterator< Entry > | |
| Cogdf::booth_lueker::PlanarLeafKey< booth_lueker::IndInfo * > | |
| Cabacus::PoolSlot< abacus::Constraint, abacus::Variable > | |
| Cabacus::PoolSlot< abacus::Variable, abacus::Constraint > | |
| Cabacus::PoolSlot< CoType, BaseType > | |
| Cabacus::PoolSlotRef< abacus::Constraint, abacus::Variable > | |
| Cabacus::PoolSlotRef< abacus::Variable, abacus::Constraint > | |
| Cabacus::PoolSlotRef< CoType, BaseType > | |
| ►Cogdf::PQNode< edge, IndInfo *, bool > | |
| Cogdf::booth_lueker::EmbedIndicator | |
| Cogdf::PQNode< edge, ogdf::whaInfo *, bool > | |
| Cogdf::PQNode< edge, whaInfo *, bool > | |
| Cogdf::PQNode< T, ogdf::whaInfo *, Y > | |
| Cogdf::PQNode< T, whaInfo *, Y > | |
| Cogdf::PQNodeKey< edge, IndInfo *, bool > | |
| Cogdf::PQNodeKey< edge, ogdf::whaInfo *, bool > | |
| Cogdf::PQNodeKey< edge, whaInfo *, bool > | |
| Cogdf::PQNodeKey< T, ogdf::whaInfo *, Y > | |
| Cogdf::PQNodeKey< T, whaInfo *, Y > | |
| ►Cogdf::PQTree< edge, IndInfo *, bool > | |
| Cogdf::booth_lueker::EmbedPQTree | |
| Cogdf::booth_lueker::PlanarPQTree | |
| ►Cogdf::PQTree< edge, whaInfo *, bool > | |
| ►Cogdf::MaxSequencePQTree< edge, bool > | |
| Cogdf::PlanarSubgraphPQTree | |
| ►Cogdf::PQTree< T, whaInfo *, Y > | |
| Cogdf::MaxSequencePQTree< T, Y > | The class template MaxSequencePQTree is designed to compute a maximal consecutive sequence of pertinent leaves in a PQ-tree |
| Cogdf::Prioritized< X *, double > | |
| Cpugi::xml_attribute | |
| Cpugi::xml_attribute_iterator | |
| Cpugi::xml_named_node_iterator | |
| ►Cpugi::xml_node | |
| Cpugi::xml_document | |
| Cpugi::xml_node_iterator | |
| Cpugi::xml_object_range< It > | |
| Cpugi::xml_parse_result | |
| Cpugi::xml_text | |
| Cpugi::xml_tree_walker | |
| ►Cpugi::xml_writer | |
| Cpugi::xml_writer_file | |
| Cpugi::xml_writer_stream | |
| 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 > | |
| CMinisat::Internal::ClauseAllocator | |
| ►CRegisteredArrayWithoutDefault | |
| Cogdf::internal::RegisteredArrayWithDefault< Registry, Value > | Registered arrays with default values |
| Cogdf::RegisteredMultiArray< const OverlappingGraphCopy *, edge > | |
| Cogdf::RegisteredMultiArray< const OverlappingGraphCopy *, node > | |
| ►Cogdf::RegisteredSet< ClusterGraph, true > | |
| Cogdf::ClusterSet< SupportFastSizeQuery > | Cluster sets |
| ►Cogdf::RegisteredSet< ConstCombinatorialEmbedding, SupportFastSizeQuery > | |
| Cogdf::FaceSet< false > | |
| ►Cogdf::RegisteredSet< ConstCombinatorialEmbedding, true > | |
| Cogdf::FaceSet< SupportFastSizeQuery > | Face sets |
| ►Cogdf::RegisteredSet< internal::GraphAdjRegistry, true > | |
| Cogdf::AdjEntrySet< SupportFastSizeQuery > | AdjEntry sets |
| ►Cogdf::RegisteredSet< internal::GraphNodeRegistry, SupportFastSizeQuery > | |
| Cogdf::NodeSet< false > | |
| Cogdf::NodeSet< true > | |
| ►Cogdf::RegisteredSet< internal::GraphNodeRegistry, true > | |
| Cogdf::NodeSet< SupportFastSizeQuery > | Node sets |
| ►Cogdf::RegistryBase< int, QPartitioning, int > | |
| Cogdf::sync_plan::QPartitioning | Manages the partitioning of Q-nodes in an instance of SyncPlan |
| ►Cogdf::RegistryBase< Key *, GraphRegistry< Key, GraphObjectContainer< Key >, 1 >, GraphObjectContainer< Key > ::iterator > | |
| Cogdf::internal::GraphRegistry< Key, Iterable, Factor > | Registry for nodes, edges and adjEntries of a graph |
| ►Cogdf::RegistryBase< Key *, HypergraphRegistry< Key >, internal::GraphIterator< Key * > > | |
| Cogdf::HypergraphRegistry< Key > | Registry for nodes and edges of a hypergraph |
| ►Cogdf::RegistryBase< ogdf::HyperedgeElement *, HypergraphRegistry< ogdf::HyperedgeElement >, internal::GraphIterator< ogdf::HyperedgeElement * > > | |
| Cogdf::HypergraphRegistry< ogdf::HyperedgeElement > | |
| ►Cogdf::RegistryBase< ogdf::HypernodeElement *, HypergraphRegistry< ogdf::HypernodeElement >, internal::GraphIterator< ogdf::HypernodeElement * > > | |
| Cogdf::HypergraphRegistry< ogdf::HypernodeElement > | |
| ►Cogdf::RegistryBase< PCNode *, PCTreeRegistry > | |
| Cogdf::pc_tree::PCTreeRegistry | A registry that allows labelling the nodes of a PC-tree |
| 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::ClusterElement > | |
| Cogdf::SListElement< ogdf::EdgeElement > | |
| Cogdf::SListElement< ogdf::ExternE > | |
| Cogdf::SListElement< ogdf::KuratowskiStructure > | |
| 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::sync_plan::internal::FrozenSimplifyMapping > | |
| 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::SList< double > | |
| Cogdf::SListPure< int > | |
| ►Cogdf::SListPure< ogdf::AdjElement > | |
| Cogdf::SList< ogdf::AdjElement > | |
| Cogdf::SListPure< ogdf::ArrayBuffer< ogdf::AdjElement > > | |
| Cogdf::SListPure< ogdf::ClusterElement > | |
| ►Cogdf::SListPure< ogdf::EdgeElement > | |
| Cogdf::SList< ogdf::EdgeElement > | |
| Cogdf::SListPure< ogdf::ExternE > | |
| Cogdf::SListPure< ogdf::KuratowskiStructure > | |
| ►Cogdf::SListPure< ogdf::NodeElement > | |
| ►Cogdf::SList< ogdf::NodeElement > | |
| Cogdf::Queue< ogdf::NodeElement > | |
| Cogdf::SListPure< ogdf::PQNode< edge, ogdf::whaInfo *, bool > * > | |
| Cogdf::SListPure< ogdf::PQNode< T, ogdf::whaInfo *, Y > * > | |
| ►Cogdf::SListPure< ogdf::SimpleCluster * > | |
| Cogdf::SList< ogdf::SimpleCluster * > | |
| Cogdf::SListPure< ogdf::SListPure< ogdf::EdgeElement > > | |
| ►Cogdf::SListPure< ogdf::sync_plan::internal::FrozenSimplifyMapping > | |
| Cogdf::SList< ogdf::sync_plan::internal::FrozenSimplifyMapping > | |
| Cogdf::SListPure< ogdf::UMLGraph::AssociationClass * > | |
| Cogdf::SListPure< ogdf::WInfo > | |
| ►Cbackward::StackTraceImpl< system_tag::current_tag > | |
| Cbackward::StackTrace | |
| ►Cabacus::StandardPool< abacus::Constraint, abacus::Variable > | |
| Cabacus::NonDuplPool< abacus::Constraint, abacus::Variable > | |
| Cabacus::StandardPool< abacus::Variable, abacus::Constraint > | |
| ►Ctype | |
| Cogdf::RegisteredArray< Registry, Value, WithDefault, Base > | Dynamic arrays indexed with arbitrary keys |
| Cogdf::RegisteredArray< ClusterGraph, ogdf::ListIteratorBase< element_type >, false > | |
| ►Cogdf::RegisteredArray< ConstCombinatorialEmbedding, bool, WithDefault > | |
| Cogdf::FaceArrayBase< bool > | |
| ►Cogdf::RegisteredArray< ConstCombinatorialEmbedding, int, WithDefault > | |
| Cogdf::FaceArrayBase< int > | |
| ►Cogdf::RegisteredArray< ConstCombinatorialEmbedding, ogdf::FaceElement, WithDefault > | |
| Cogdf::FaceArrayBase< ogdf::FaceElement > | |
| ►Cogdf::RegisteredArray< ConstCombinatorialEmbedding, ogdf::List< ogdf::NodeElement >, WithDefault > | |
| Cogdf::FaceArrayBase< ogdf::List< ogdf::NodeElement > > | |
| Cogdf::RegisteredArray< ConstCombinatorialEmbedding, ogdf::ListIteratorBase< element_type >, false > | |
| ►Cogdf::RegisteredArray< ConstCombinatorialEmbedding, ogdf::NodeElement, WithDefault > | |
| Cogdf::FaceArrayBase< ogdf::NodeElement > | |
| ►Cogdf::RegisteredArray< ConstCombinatorialEmbedding, Value, WithDefault > | |
| Cogdf::FaceArrayBase< Value, WithDefault > | RegisteredArray for labeling the faces of a CombinatorialEmbedding |
| ►Cogdf::RegisteredArray< GraphRegistry< ATYPE >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ATYPE > | |
| ►Cogdf::RegisteredArray< GraphRegistry< BCTree::BNodeType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< BCTree::BNodeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< BendType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< BendType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< BNodeType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< BNodeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< bool >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< bool > | |
| ►Cogdf::RegisteredArray< GraphRegistry< cutType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< cutType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< double >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< double > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ATYPE, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ATYPE, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ATYPE, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ATYPE > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, bool, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, bool, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< bool, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< bool > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, BoyerMyrvoldEdgeType, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, BoyerMyrvoldEdgeType, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< BoyerMyrvoldEdgeType, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< BoyerMyrvoldEdgeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ConstraintEdgeType, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ConstraintEdgeType, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ConstraintEdgeType, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ConstraintEdgeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, double, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, double, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< double, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< double > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, edge, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, edge, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< edge, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< edge, WithDefault > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, EdgeArrow, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, EdgeArrow, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< EdgeArrow, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< EdgeArrow > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, EdgeType, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, EdgeType, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< EdgeType, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< EdgeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, edgeType, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, edgeType, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< edgeType, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< edgeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, float, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, float, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< float, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< float > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, Graph::EdgeType, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, Graph::EdgeType, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< Graph::EdgeType, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< Graph::EdgeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, int, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, int, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< int, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< int > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::AdjElement, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::AdjElement, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::AdjElement, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::AdjElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::ArrayBuffer< ogdf::EdgeElement > *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::ArrayBuffer< ogdf::EdgeElement > *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::ArrayBuffer< ogdf::EdgeElement > *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::ArrayBuffer< ogdf::EdgeElement > * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::Block *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::Block *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::Block *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::Block * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::booth_lueker::PlanarLeafKey, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::booth_lueker::PlanarLeafKey, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::booth_lueker::PlanarLeafKey, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::booth_lueker::PlanarLeafKey > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::ClusterElement, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::ClusterElement, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::ClusterElement, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::ClusterElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::EdgeElement, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::EdgeElement, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::EdgeElement, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::EdgeElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::EdgeLabel< coordType >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::EdgeLabel< coordType >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::EdgeLabel< coordType >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::EdgeLabel< coordType > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::embedder::MDMFLengthAttribute, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::embedder::MDMFLengthAttribute, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::embedder::MDMFLengthAttribute, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::embedder::MDMFLengthAttribute > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::fast_multipole_embedder::GalaxyMultilevel::LevelEdgeInfo, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::fast_multipole_embedder::GalaxyMultilevel::LevelEdgeInfo, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::fast_multipole_embedder::GalaxyMultilevel::LevelEdgeInfo, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::fast_multipole_embedder::GalaxyMultilevel::LevelEdgeInfo > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::GenericPolyline, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::GenericPolyline, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::GenericPolyline, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::GenericPolyline > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::Graph *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::Graph *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::Graph *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::Graph * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::HyperedgeElement, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::HyperedgeElement, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::HyperedgeElement, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::HyperedgeElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::internal::EdgeArrayBase2< ogdf::EdgeElement > *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::internal::EdgeArrayBase2< ogdf::EdgeElement > *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::internal::EdgeArrayBase2< ogdf::EdgeElement > *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::internal::EdgeArrayBase2< ogdf::EdgeElement > * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::internal::GraphRegisteredArray< ogdf::NodeElement > *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::internal::GraphRegisteredArray< ogdf::NodeElement > *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::internal::GraphRegisteredArray< ogdf::NodeElement > *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::internal::GraphRegisteredArray< ogdf::NodeElement > * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::List< ogdf::EdgeElement >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::List< ogdf::EdgeElement >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::List< ogdf::EdgeElement >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::List< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::List< ogdf::GenericPoint >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::List< ogdf::GenericPoint >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::List< ogdf::GenericPoint >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::List< ogdf::GenericPoint > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::List< ogdf::NonPlanarCore::CutEdge >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::List< ogdf::NonPlanarCore::CutEdge >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::List< ogdf::NonPlanarCore::CutEdge >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::List< ogdf::NonPlanarCore::CutEdge > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::List< ogdf::topology_module::EdgeLeg * >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::List< ogdf::topology_module::EdgeLeg * >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::List< ogdf::topology_module::EdgeLeg * >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::List< ogdf::topology_module::EdgeLeg * > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::ListIteratorBase< int >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::ListIteratorBase< int >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::ListIteratorBase< int >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::ListIteratorBase< int > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::ListIteratorBase< ogdf::EdgeElement >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::ListIteratorBase< ogdf::EdgeElement >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::ListIteratorBase< ogdf::EdgeElement >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::ListIteratorBase< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::ListPure< ogdf::EdgeElement >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::ListPure< ogdf::EdgeElement >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::ListPure< ogdf::EdgeElement >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::ListPure< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::matching_blossom::AuxEdge< TWeight > *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::matching_blossom::AuxEdge< TWeight > *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::matching_blossom::AuxEdge< TWeight > *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::matching_blossom::AuxEdge< TWeight > * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::MinSteinerTreeDirectedCut::EdgeVariable *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::MinSteinerTreeDirectedCut::EdgeVariable *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::MinSteinerTreeDirectedCut::EdgeVariable *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::MinSteinerTreeDirectedCut::EdgeVariable * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::NodeElement, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::NodeElement, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::NodeElement, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::NodeElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::OverlappingGraphCopy *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::OverlappingGraphCopy *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::OverlappingGraphCopy *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::OverlappingGraphCopy * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::PlanRepExpansion::NodeSplit *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::PlanRepExpansion::NodeSplit *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::PlanRepExpansion::NodeSplit *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::PlanRepExpansion::NodeSplit * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::SList< ogdf::EdgeElement >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::SList< ogdf::EdgeElement >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::SList< ogdf::EdgeElement >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::SList< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::SListPure< int >, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::SListPure< int >, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::SListPure< int >, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::SListPure< int > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::StaticSkeleton *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::StaticSkeleton *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::StaticSkeleton *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::StaticSkeleton * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::Stroke, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::Stroke, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::Stroke, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::Stroke > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::UMLGraph::AssociationClass *, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::UMLGraph::AssociationClass *, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::UMLGraph::AssociationClass *, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::UMLGraph::AssociationClass * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, ogdf::VisibilityLayout::EdgeSegment, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, ogdf::VisibilityLayout::EdgeSegment, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< ogdf::VisibilityLayout::EdgeSegment, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< ogdf::VisibilityLayout::EdgeSegment > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, PrioritizedQueue< edge, P, C, Impl >::Handle, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, PrioritizedQueue< edge, P, C, Impl >::Handle, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< PrioritizedQueue< edge, P, C, Impl >::Handle, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< PrioritizedQueue< edge, P, C, Impl >::Handle > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, string, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, string, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< string, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< string > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, T, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, T, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< T, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< T > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, TCap, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, TCap, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< TCap, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< TCap > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, TCost, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, TCost, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< TCost, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< TCost > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, TWeight, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, TWeight, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< TWeight, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< TWeight > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, uint32_t, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, uint32_t, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< uint32_t, WithDefault > | |
| Cogdf::internal::EdgeArrayBase2< uint32_t > | |
| ►Cogdf::RegisteredArray< GraphRegistry< EdgeElement >, Value, WithDefault, Graph > | |
| ►Cogdf::internal::GraphRegisteredArray< EdgeElement, Value, WithDefault > | |
| ►Cogdf::internal::EdgeArrayBase1< Value, WithDefault > | RegisteredArray for edges of a graph |
| Cogdf::internal::EdgeArrayBase2< Value, WithDefault > | RegisteredArray for edges of a graph, specialized for EdgeArray<edge> |
| ►Cogdf::RegisteredArray< GraphRegistry< float >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< float > | |
| ►Cogdf::RegisteredArray< GraphRegistry< Graph::NodeType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< Graph::NodeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< int >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< int > | |
| ►Cogdf::RegisteredArray< GraphRegistry< Key >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< Key, Value, WithDefault, Registry > | RegisteredArray for nodes, edges and adjEntries of a graph |
| ►Cogdf::RegisteredArray< GraphRegistry< NodeColor >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< NodeColor > | |
| ►Cogdf::RegisteredArray< GraphRegistry< NodeType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< NodeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< nodeType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< nodeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::AdjElement >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::AdjElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::Array< ogdf::NodeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::Array< ogdf::NodeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ArrayBuffer< ogdf::EdgeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ArrayBuffer< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::BendString >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::BendString > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::BertaultLayout::BertaultSections >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::BertaultLayout::BertaultSections > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::Block * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::Block * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ClusterArrayBase< int > * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ClusterArrayBase< int > * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ClusterElement >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ClusterElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::CoffmanGrahamRanking::_int_set >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::CoffmanGrahamRanking::_int_set > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::DIntersectableRect >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::DIntersectableRect > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::DRect >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::DRect > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::DynamicSkeleton * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::DynamicSkeleton * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::edge_router::NodeInfo >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::edge_router::NodeInfo > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::EdgeElement >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::EdgeElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::embedder::MDMFLengthAttribute >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::embedder::MDMFLengthAttribute > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::energybased::dtree::DTreeEmbedder::NodeInfo >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::energybased::dtree::DTreeEmbedder::NodeInfo > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::FaceElement >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::FaceElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::fast_multipole_embedder::GalaxyMultilevel::LevelNodeInfo >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::fast_multipole_embedder::GalaxyMultilevel::LevelNodeInfo > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::fast_multipole_embedder::GalaxyMultilevelBuilder::LevelNodeState >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::fast_multipole_embedder::GalaxyMultilevelBuilder::LevelNodeState > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::Fill >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::Fill > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::GenericPoint >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::GenericPoint > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::Graph >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::Graph > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::GraphCopySimple * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::GraphCopySimple * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::HypernodeElement >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::HypernodeElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::InOutPoint * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::InOutPoint * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::EdgeArrayBase2< ogdf::EdgeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::EdgeArrayBase2< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::GraphRegisteredArray< bool > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::GraphRegisteredArray< bool > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::GraphRegisteredArray< double > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::GraphRegisteredArray< double > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::GraphRegisteredArray< int > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::GraphRegisteredArray< int > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::GraphRegisteredArray< ogdf::EdgeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::GraphRegisteredArray< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::GraphRegisteredArray< ogdf::NodeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::GraphRegisteredArray< ogdf::NodeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::GraphRegisteredArray< T > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::GraphRegisteredArray< T > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::internal::GraphRegisteredArray< TWeight > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::internal::GraphRegisteredArray< TWeight > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::List< int > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::List< int > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::List< ogdf::AdjElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::List< ogdf::AdjElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::List< ogdf::EdgeElement > * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::List< ogdf::EdgeElement > * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::List< ogdf::EdgeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::List< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::List< ogdf::InOutPoint > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::List< ogdf::InOutPoint > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::List< ogdf::ListIteratorBase< ogdf::steiner_tree::LowerBoundDualAscent::TerminalData > > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::List< ogdf::ListIteratorBase< ogdf::steiner_tree::LowerBoundDualAscent::TerminalData > > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::List< ogdf::NodeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::List< ogdf::NodeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ListIteratorBase< ogdf::AdjElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ListIteratorBase< ogdf::AdjElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ListIteratorBase< ogdf::InOutPoint > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ListIteratorBase< ogdf::InOutPoint > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ListIteratorBase< ogdf::NodeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ListIteratorBase< ogdf::NodeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ListIteratorBase< ogdf::PALabel > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ListIteratorBase< ogdf::PALabel > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::ListPure< ogdf::NodeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::ListPure< ogdf::NodeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::matching_blossom::AuxNode< TWeight > * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::matching_blossom::AuxNode< TWeight > * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::MinimumEdgeDistances::InfoType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::MinimumEdgeDistances::InfoType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::NodeElement >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::NodeElement > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::OrthoRep::VertexInfoUML * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::OrthoRep::VertexInfoUML * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::PALabel >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::PALabel > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::RoutingChannel::vInfo >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::RoutingChannel::vInfo > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SList< int > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SList< int > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SList< ogdf::AdjElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SList< ogdf::AdjElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SList< ogdf::EdgeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SList< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SList< ogdf::MultiEdgeApproxInserter::VertexBlock > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SList< ogdf::MultiEdgeApproxInserter::VertexBlock > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SList< ogdf::NodeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SList< ogdf::NodeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SListPure< ogdf::AdjElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SListPure< ogdf::AdjElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SListPure< ogdf::booth_lueker::PlanarLeafKey > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SListPure< ogdf::booth_lueker::PlanarLeafKey > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SListPure< ogdf::EdgeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SListPure< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SListPure< ogdf::NodeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SListPure< ogdf::NodeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::SListPure< ogdf::Tuple2< ogdf::NodeElement, int > > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::SListPure< ogdf::Tuple2< ogdf::NodeElement, int > > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::StaticSkeleton * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::StaticSkeleton * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::StaticSPQRTree * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::StaticSPQRTree * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::Stroke >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::Stroke > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::sync_plan::Pipe * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::sync_plan::Pipe * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::twosat_var >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::twosat_var > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::VisibilityLayout::NodeSegment >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::VisibilityLayout::NodeSegment > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ogdf::WInfo * >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ogdf::WInfo * > | |
| ►Cogdf::RegisteredArray< GraphRegistry< OrthoDir >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< OrthoDir > | |
| ►Cogdf::RegisteredArray< GraphRegistry< PrioritizedQueue< node, P, C, Impl >::Handle >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< PrioritizedQueue< node, P, C, Impl >::Handle > | |
| ►Cogdf::RegisteredArray< GraphRegistry< ProcessType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< ProcessType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< Shape >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< Shape > | |
| ►Cogdf::RegisteredArray< GraphRegistry< short >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< short > | |
| ►Cogdf::RegisteredArray< GraphRegistry< std::pair< int, ogdf::EdgeElement > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< std::pair< int, ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< std::vector< ogdf::SolarMerger::PathData > >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< std::vector< ogdf::SolarMerger::PathData > > | |
| ►Cogdf::RegisteredArray< GraphRegistry< string >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< string > | |
| ►Cogdf::RegisteredArray< GraphRegistry< T >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< T > | |
| ►Cogdf::RegisteredArray< GraphRegistry< TCap >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< TCap > | |
| ►Cogdf::RegisteredArray< GraphRegistry< TNodeType >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< TNodeType > | |
| ►Cogdf::RegisteredArray< GraphRegistry< TWeight >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< TWeight > | |
| ►Cogdf::RegisteredArray< GraphRegistry< unsigned int >, Value, WithDefault, Graph > | |
| Cogdf::internal::GraphRegisteredArray< unsigned int > | |
| ►Cogdf::RegisteredArray< HypergraphRegistry< double >, Value, WithDefault, Hypergraph > | |
| Cogdf::HypergraphRegisteredArray< double > | |
| ►Cogdf::RegisteredArray< HypergraphRegistry< int >, Value, WithDefault, Hypergraph > | |
| Cogdf::HypergraphRegisteredArray< int > | |
| ►Cogdf::RegisteredArray< HypergraphRegistry< Key >, Value, WithDefault, Hypergraph > | |
| Cogdf::HypergraphRegisteredArray< Key, Value, WithDefault, Registry > | RegisteredArray for nodes and edges of a hypergraph |
| ►Cogdf::RegisteredArray< HypergraphRegistry< ogdf::List< ogdf::EdgeElement > >, Value, WithDefault, Hypergraph > | |
| Cogdf::HypergraphRegisteredArray< ogdf::List< ogdf::EdgeElement > > | |
| ►Cogdf::RegisteredArray< HypergraphRegistry< ogdf::NodeElement >, Value, WithDefault, Hypergraph > | |
| Cogdf::HypergraphRegisteredArray< ogdf::NodeElement > | |
| ►Cogdf::RegisteredArray< HypergraphRegistry< string >, Value, WithDefault, Hypergraph > | |
| Cogdf::HypergraphRegisteredArray< string > | |
| Cogdf::RegisteredArray< internal::GraphAdjRegistry, ogdf::ListIteratorBase< element_type >, false > | |
| Cogdf::RegisteredArray< internal::GraphNodeRegistry, ogdf::ListIteratorBase< element_type >, false > | |
| Cogdf::RegisteredArray< ogdf::EdgeElement > | |
| Cogdf::RegisteredArray< ogdf::List< ogdf::EdgeElement > > | |
| Cogdf::RegisteredArray< ogdf::List< ogdf::NodeElement > > | |
| Cogdf::RegisteredArray< ogdf::NodeElement > | |
| Cogdf::RegisteredArray< Registry, ogdf::ListIteratorBase< element_type >, false > | |
| ►Cogdf::RegisteredArray< Registry, unsigned char, WithDefault, Base > | |
| Cogdf::RegisteredArray< Registry, bool, WithDefault, Base > | Specialization to work around vector<bool> |
| ►Cexception | |
| ►Cogdf::Exception | Base class of all ogdf exceptions |
| Cogdf::AlgorithmFailureException | Exception thrown when an algorithm realizes an internal bug that prevents it from continuing |
| Cogdf::DynamicCastFailedException | Exception thrown when result of cast is 0 |
| Cogdf::InsufficientMemoryException | Exception thrown when not enough memory is available to execute an algorithm |
| Cogdf::LibraryNotSupportedException | Exception thrown when an external library shall be used which is not supported |
| Cogdf::NoStdComparerException | Exception thrown when a required standard comparer has not been specialized |
| Cogdf::TypeNotSupportedException | Exception thrown when a data type is not supported by a generic function |
| Cogdf::pc_tree::GraphNotPlanarException | |
| ►Cfalse_type | |
| Cogdf::internal::is_iterator< T, class > | |
| Cstd::hash< ogdf::gml::Key > | |
| ►Cthread | |
| Cogdf::Thread | Threads supporting OGDF's memory management |
| ►Ctrue_type | |
| Cogdf::internal::is_iterator< T, std::void_t< typename std::iterator_traits< T >::iterator_category > > | |
| ►Citerator | |
| Cogdf::matching_blossom::MapKeyIterator< Key, Value > | Iterator to access the keys of a std::unordered_map |
| Cogdf::matching_blossom::MapValueIterator< Key, Value > | Iterator to access the values of a std::unordered_map |
| ►Cvector | |
| Cogdf::internal::gcm::datastructure::EdgeVector< T, Graph > | |
| Cogdf::internal::gcm::datastructure::NodeVector< T, Graph > | |
| Cogdf::StdComparer< KEY > | |
| Cogdf::SubsetEnumerator< ogdf::NodeElement > | |
| ►Cbackward::TraceResolverImpl< system_tag::current_tag > | |
| Cbackward::TraceResolver | |
| Cogdf::Tuple2< I1_, I2_ > | |
| ►Cogdf::VComparer< adjEntry > | |
| Cogdf::EdgeComparer | Compares adjacency entries based on the position of the nodes given by GraphAttribute layout information |
| Cogdf::EdgeComparerSimple | Compares incident edges of a node based on the position of the last bend point or the position of the adjacent node given by the layout information of the graph |
| 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 > | |
