  ogdf | The namespace for all OGDF objects |
   AcyclicSubgraphModule | Base class of algorithms for computing a maximal acyclic subgraph |
| AddNodeComparer | Node comparer for sorting by decreasing int values |
| AdjacencyOracle | Tells you in linear time if two nodes are adjacent |
| AdjElement | Class for adjacency list elements |
| AdjEntryArray | Dynamic arrays indexed with adjacency entries |
| AdjEntryArrayBase | Abstract base class for adjacency entry arrays |
| AlgorithmFailureException | Exception thrown when an algorithm realizes an internal bug that prevents it from continuing |
| AnyOption | |
| Array | The parameterized class Array<E,INDEX> implements dynamic arrays of type E |
| Array2D | The parameterized class Array2D<E> implements dynamic two-dimensional arrays |
| ArrayBuffer | An array that keeps track of the number of inserted elements; also usable as an efficient stack |
| Attraction | Energy function for attraction between two adjacent vertices |
| AugmentationModule | The base class for graph augmentation algorithms |
| BalloonLayout | |
| Barrier | Representation of a barrier |
| BarycenterHeuristic | The barycenter heuristic for 2-layer crossing minimization |
| BarycenterPlacer | |
| BaseConstraint | Basic constraint type |
| BasicPageRank | Basic page rank calculation |
| BCTree | Static BC-trees |
| BendString | |
| BiconnectedShellingOrder | Computation of the shelling order for biconnected graphs |
 BinaryHeap | |
  Element | |
| BinaryHeap2 | Min-heap priority queue realized by a data array |
| HeapEntry | |
| BinaryHeapSimple | Dynamically growing binary heap tuned for efficiency on a small interface (compared to BinaryHeap) |
| BoothLueker | Booth-Lueker planarity test |
| BoundedQueue | The parameterized class BoundedQueue<E,INDEX> implements queues with bounded size |
| BoundedStack | The parameterized class BoundedStack<E,INDEX> implements stacks with bounded size |
| BoyerMyrvold | Wrapper class used for preprocessing and valid invocation of the planarity test |
| BoyerMyrvoldInit | This class is used in the Boyer-Myrvold planarity test for preprocessing purposes |
| BoyerMyrvoldPlanar | This class implements the extended BoyerMyrvold planarity embedding algorithm |
| BucketEdgeArray | Bucket function for edges |
| BucketFunc | Abstract base class for bucket functions |
| BucketLowPoint | BucketFunction for lowPoint buckets |
| BucketSourceIndex | Bucket function using the index of an edge's source node as bucket |
| BucketTargetIndex | Bucket function using the index of an edge's target node as bucket |
| CCLayoutPackModule | Base class of algorithms that arrange/pack layouts of connected components |
| CconnectClusterPlanar | |
| CconnectClusterPlanarEmbed | |
| ChunkConnection | |
| CirclePlacer | |
| CircularLayout | The circular layout algorithm |
| CliqueFinder | Finds cliques and dense subgraphs |
| ClusterArray | Dynamic arrays indexed with clusters |
| ClusterArrayBase | Abstract base class for cluster arrays |
| ClusterElement | Representation of clusters in a clustered graph |
| Clusterer | |
| ClustererModule | Interface for algorithms that compute a clustering for a given graph |
| ClusterGraph | Representation of clustered graphs |
| ClusterGraphAttributes | Stores additional attributes of a clustered graph (like layout information) |
| ClusterGraphCopy | |
| ClusterGraphCopyAttributes | Manages access on copy of an attributed clustered graph |
| ClusterGraphObserver | |
| ClusterInfo | Stores information associated with a cluster |
| ClusterOrthoLayout | |
| ClusterOrthoShaper | |
| ClusterPlanarizationLayout | The cluster planarization layout algorithm |
| ClusterPosition | |
| ClusterPlanRep | |
| ClusterPQContainer | |
| ClusterSet | |
| ClusterSetPure | |
| ClusterSetSimple | |
| CoffmanGrahamRanking | The coffman graham ranking algorithm |
| _int_set | |
| CoinCallbacks | |
| CoinManager | |
| CombinatorialEmbedding | Combinatorial embeddings of planar graphs with modification functionality |
| CompactionConstraintGraph | |
| Interval | |
| SegmentComparer | |
| CompactionConstraintGraphBase | |
| ComponentSplitterLayout | |
| CompressionOption | |
| ConnectedSubgraph | |
| ConstCombinatorialEmbedding | Combinatorial embeddings of planar graphs |
| Constraint | |
| ConstraintManager | |
| ConvexHull | |
| CPlanarEdgeInserter | |
| CPlanarSubClusteredGraph | Constructs a c-planar subclustered graph of the input on base of a spanning tree |
| CPlanarSubClusteredST | Constructs a c-planar subclustered spanning tree of the input by setting edgearray values |
| CPlanarSubgraphModule | Interface of algorithms for the computation of c-planar subgraphs |
| CriticalSection | Representation of a critical section |
| CrossingMinimizationModule | Interface for crossing minimization algorithms |
| CrossingsMatrix | |
| CutConstraint | |
| DavidsonHarel | The Davidson-Harel approach for drawing graphs |
| DavidsonHarelLayout | The Davidson-Harel layout algorithm |
| DefHashFunc | Default hash functions |
| DefHashFunc< double > | Specialized default hash function for double |
| DefHashFunc< IPoint > | |
| DefHashFunc< String > | |
| DefHashFunc< void * > | Specialized default hash function for pointer types |
| DeletingTop10Heap | A variant of Top10Heap which deletes the elements that get rejected from the heap |
| DfsAcyclicSubgraph | DFS-based algorithm for computing a maximal acyclic subgraph |
| DfsMakeBiconnected | Implementation of a DFS-based algorithm for biconnectivity augmentation |
| Dijkstra | Dijkstra's single source shortest path algorithm |
| DinoLineBuffer | |
| DinoLineBufferPosition | |
| DinoTools | |
| DinoUmlDiagramGraph | |
| DinoUmlModelGraph | |
| DinoUmlToGraphConverter | |
| DinoXmlParser | |
| DinoXmlScanner | |
| DisjointSets | A Union/Find data structure for maintaining disjoint sets |
| DLine | Lines with real coordinates |
| DominanceLayout | |
| DPoint | Real points |
| DPolygon | Polygons with real coordinates |
| DPolyline | Polylines with real coordinates |
| DRect | Rectangles with real coordinates |
| DScaler | Scaling between coordinate systems |
| DSegment | Line segments with real coordinates |
| DualGraph | A dual graph including its combinatorial embedding of an embedded graph |
| DVector | Vectors with real coordinates |
| DynamicBacktrack | Extracts all possible paths with backtracking using given edges and special constraints |
| DynamicBCTree | Dynamic BC-trees |
| DynamicCastFailedException | Exception thrown when result of cast is 0 |
| DynamicPlanarSPQRTree | SPQR-trees of planar graphs |
| DynamicSkeleton | Skeleton graphs of nodes in a dynamic SPQR-tree |
| DynamicSPQRForest | Dynamic SPQR-forest |
| DynamicSPQRTree | Linear-time implementation of dynamic SPQR-trees |
| EdgeArray | Dynamic arrays indexed with edges |
| EdgeArrayBase | Abstract base class for edge arrays |
| EdgeAttributes | |
| EdgeComparer | The EdgeComparer compares adjacency entries on base of the position of the nodes given by an Attributed Graph's layout information |
| EdgeComparerSimple | |
| EdgeCoverMerger | |
| EdgeElement | Class for the representation of edges |
| EdgeInsertionModule | Interface for edge insertion algorithms |
| EdgeLabel | |
| EdgeLeg | |
| EdgeRouter | |
| edgeValue | |
| EdgeVar | |
| EdgeWeightedGraph | |
| EdgeWeightedGraphCopy | |
| EFreeList | Simple implementation of a FreeList which buffers the memory allocation of an embedded list item |
| EFreeListIndexPool | More complex implementation of a FreeList, which is able to generate indeices for the elements |
| EFreeListTypes | Type declarations for EFreeList |
| ELabelInterface | |
| ELabelPos | |
| FeatureComparer | |
| FeatureInfo | |
| FeatureLink | |
| LabelInfo | |
| PosInfo | |
| SegmentInfo | |
| ELabelPosSimple | |
| EList | The embedded list template |
| EListIterator | Implementation of an embedded list iterator used by EList |
| EmbedderMaxFace | Planar graph embedding with maximum external face |
| EmbedderMaxFaceBiconnectedGraphs | Computes an embedding of a biconnected graph with maximum external face |
| EmbedderMaxFaceBiconnectedGraphsLayers | Computes an embedding of a biconnected graph with maximum external face (plus layers approach) |
| EmbedderMaxFaceLayers | Planar graph embedding with maximum external face (plus layers approach) |
| EmbedderMinDepth | Planar graph embedding with minimum block-nesting depth |
| EmbedderMinDepthMaxFace | Planar graph embedding with minimum block-nesting depth and maximum external face |
| EmbedderMinDepthMaxFaceLayers | Planar graph embedding with minimum block-nesting depth and maximum external face (plus layers approach) |
| EmbedderMinDepthPiTa | Planar graph embedding with minimum block-nesting depth for given embedded blocks |
| EmbedderModule | Base class for embedder algorithms |
| EmbedIndicator | |
| EmbedPQTree | |
| EnergyFunction | The interface for energy functions for the Davidson Harel graph drawing method |
| ENGLayer | |
| EStack | The embedded stack class template |
| Exception | Base class of all ogdf exceptions |
| ExpansionGraph | |
| ExtendedNestingGraph | |
| ExternE | List of externally active nodes strictly between x and y for minortypes B and E |
| ExtractKuratowskis | Extracts multiple Kuratowski Subdivisions |
| FaceArray | Dynamic arrays indexed with faces of a combinatorial embedding |
| FaceArrayBase | Abstract base class for face arrays |
| FaceElement | Faces in a combinatorial embedding |
| FaceSet | Maintains a subset S of the faces contained in an associated combinatorial embedding E |
| FaceSetPure | Maintains a subset S of the faces contained in an associated combinatorial embedding E |
| FaceSetSimple | Maintains a subset S of the faces contained in an associated combinatorial embedding E |
| FaceSinkGraph | |
| FastHierarchyLayout | Coordinate assignment phase for the Sugiyama algorithm by Buchheim et al. |
| FastMultipoleEmbedder | |
| FastMultipoleMultilevelEmbedder | |
| FastPlanarSubgraph | Computation of a planar subgraph using PQ-trees |
| FastSimpleHierarchyLayout | Coordinate assignment phase for the Sugiyama algorithm by Ulrik Brandes and Boris Köpf |
| FeasibleUpwardPlanarSubgraph | |
| FindKuratowskis | This class collects information about Kuratowski Subdivisions which is used for extraction later |
| FixedEmbeddingInserter | Edge insertion module that inserts each edge optimally into a fixed embedding |
| FixedEmbeddingUpwardEdgeInserter | Edge insertion module that inserts each edge optimally into a fixed embedding |
| FixedUpwardEmbeddingInserter | |
| FlowCompaction | Compaction algorithm using min-cost flow in the dual of the constraint graph |
| FMMMLayout | The fast multipole multilevel layout algorithm |
| ForceLayoutModule | Interface of general layout algorithms |
| FPPLayout | |
| FruchtermanReingold | |
| FUPSModule | Interface for feasible upward planar subgraph algorithms |
| FUPSSimple | |
| GEMLayout | The energy-based GEM layout algorithm |
| GenericPoint | Parameterized base class for points |
| GmlObject | |
| GmlParser | |
| Graph | Data type for general directed graphs (adjacency list representation) |
| GraphAttributes | Stores additional attributes of a graph (like layout information) |
| GraphConstraints | |
| GraphCopy | Copies of graphs supporting edge splitting |
| GraphCopyAttributes | |
| GraphCopySimple | Copies of graphs with mapping between nodes and edges |
| GraphElement | The base class for objects used by graphs like nodes, edges, etc |
| GraphList | Lists of graph objects (like nodes, edges, etc.) |
| GraphListBase | Base class for GraphElement lists |
| GraphObserver | Abstract Base class for classes that need to keep track of changes in the graph like addition/deletion of nodes or edges. derived classes have to overload nodeDeleted, nodeAdded edgeDeleted, edgeAdded these functions should be called by Graph before (delete) |
| GraphReduction | |
| GreedyCycleRemoval | Greedy algorithm for computing a maximal acyclic subgraph |
| GreedyInsertHeuristic | The greedy-insert heuristic for 2-layer crossing minimization |
| GreedySwitchHeuristic | The greedy-switch heuristic for 2-layer crossing minimization |
| GridLayout | Representation of a graph's grid layout |
| GridLayoutMapped | |
| GridLayoutModule | Base class for grid layout algorithms |
| GridLayoutPlanRepModule | Base class for grid layout algorithms operating on a PlanRep |
| HashArray | Indexed arrays using hashing for element access |
| HashArray2D | Indexed 2-dimensional arrays using hashing for element access |
| HashConstIterator | Iterators for hash tables |
| HashConstIterator2D | Const-iterator for 2D-hash arrays |
| HashElement | Representation of elements in a hash table |
| HashElementBase | Base class for elements within a hash table |
| HashFuncTuple | |
| Hashing | Hashing with chaining and table doubling |
| HashingBase | Base class for hashing with chaining and table doubling |
| HeapBase | |
| HeapElement | |
| Hierarchy | Representation of proper hierarchies used by Sugiyama-layout |
| HierarchyClusterLayoutModule | Interface of hierarchy layout algorithms for cluster graphs |
| HierarchyLayoutModule | Interface of hierarchy layout algorithms |
| HyperGraph | |
| AdjArray | Dynamic arrays indexed with adjacency entries |
| AdjElement | Representation of adjacency elements |
| ArrayController | Array controllers manage the graph arrays of an element |
| ArrayControllerTypes | |
| EdgeArray | Dynamic arrays indexed with hyper edges |
| EdgeElement | Representation of hyper edges |
| GraphArray | |
| GraphArrayBase | |
| NodeArray | Dynamic arrays indexed with nodes |
| NodeElement | Representation of node elements |
| HyperGraphTypes | Type declarations for HyperGraph |
| IncNodeInserter | |
| IndependentSetMerger | |
| IndInfo | |
| Initialization | |
| InitialPlacer | |
| InsufficientMemoryException | Exception thrown when not enough memory is available to execute an algorithm |
| InterleavingOption | |
| IntersectionRectangle | |
| IPoint | Integer points |
| IPolyline | Polylines with integer coordinates |
| KuratowskiConstraint | |
| KuratowskiStructure | A Kuratowski Structure is a special graph structure containing severals subdivisions |
| KuratowskiSubdivision | |
| KuratowskiWrapper | Wrapper-class for Kuratowski Subdivisions containing the minortype and edgelist |
| LayerBasedUPRLayout | |
| RankComparer | |
| Layout | Stores a layout of a graph (coordinates of nodes, bend points of edges) |
| LayoutClusterPlanRepModule | Interface for planar cluster layout algorithms |
| LayoutModule | Interface of general layout algorithms |
| LayoutPlanRepModule | Interface for planar UML layout algorithms |
| Level | Representation of levels in hierarchies |
| LHTreeNode | |
| Adjacency | |
| ClusterCrossing | |
| LibraryNotSupportedException | Exception thrown when an external library shall be used which is not supported |
| LinkOption | |
| List | The parameterized class ListPure<E> represents doubly linked lists with content type E |
| ListConstIterator | The parameterized class ListIterator<E> encapsulates a constant pointer to a list element |
| ListElement | The parameterized class ListElement<E> represents the structure for elements of doubly linked lists |
| ListIterator | The parameterized class ListIterator<E> encapsulates a pointer to a dlist element |
| ListPure | The parameterized class ListPure<E> represents doubly linked lists with content type E |
| LocalBiconnectedMerger | |
| Logger | Centralized global and local logging facility working on streams like cout |
| LongestPathCompaction | Compaction algorithm using longest paths in the constraint graph |
| LongestPathRanking | The longest-path ranking algorithm |
| LPSolver | |
| MallocMemoryAllocator | Implements a simple memory manager using malloc() and free() |
| MemElem | |
| Master | |
| MatchingMerger | |
| Math | |
| MaximalPlanarSubgraphSimple | |
| MaximumCPlanarSubgraph | Exact computation of a maximum c-planar subgraph |
| MaximumPlanarSubgraph | |
| MaxPlanarEdgesConstraint | |
| MaxSequencePQTree | |
| MDMFLengthAttribute | |
| MedianHeuristic | The median heuristic for 2-layer crossing minimization |
| MedianPlacer | |
| MinCostFlowModule | Interface for min-cost flow algorithms |
| MinCostFlowReinelt | |
| arctype | |
| nodetype | |
| MinCut | |
| MinimalClusterConnection | |
| MinimumEdgeDistances | |
| InfoType | |
| MinPriorityQueue | |
| MixedForceLayout | |
| MixedModelCrossingsBeautifierModule | The base class for Mixed-Model crossings beautifier algorithms |
| MixedModelLayout | Implementation of the Mixed-Model layout algorithm |
| MMCBBase | Common base class for MMCBDoubleGrid and MMCBLocalStretch |
| MMCBDoubleGrid | Crossings beautifier using grid doubling |
| MMCBLocalStretch | Crossings beautifier using a local stretch strategy |
| MMCrossingMinimizationModule | Interface for minor-monotone crossing minimization algorithms |
| MMDummyCrossingsBeautifier | Dummy implementation of Mixed-Model crossings beautifier |
| MMEdgeInsertionModule | Interface for minor-monotone edge insertion algorithms |
| MMFixedEmbeddingInserter | Minor-monotone edge insertion with fixed embedding |
| MMMExampleFastLayout | An example Layout using the Modular Mutlievel Mixer |
| MMMExampleNiceLayout | An example Layout using the Modular Mutlievel Mixer |
| MMMExampleNoTwistLayout | An example Layout using the Modular Mutlievel Mixer |
| MMSubgraphPlanarizer | Planarization approach for minor-monotone crossing minimization |
| MMVariableEmbeddingInserter | Minor-monotone edge insertion with variable embedding |
| AnchorNodeInfo | |
| Paths | |
| ModularMultilevelMixer | Modular multilevel graph layout |
| Module | Base class for modules |
| ModuleOption | The parameterized base class for module options |
| MultiEdgeApproxInserter | |
| VertexBlock | |
| MultilevelBuilder | |
| MultilevelGraph | |
| MultilevelLayout | |
| MultilevelLayoutModule | Interface of general layout algorithms that also allow a MultilevelGraph as call parameter, extending the interface of a simple LayoutModule |
| NearestRectangleFinder | |
| PairRectDist | |
| RectRegion | |
| NMM | |
| NodeArray | Dynamic arrays indexed with nodes |
| NodeArrayBase | Abstract base class for node arrays |
| NodeAttributes | |
| NodeComparer | |
| NodeElement | Class for the representation of nodes |
| NodeInfo | |
| NodeMerge | |
| nodePair | Struct for storing the two corresponding nodes of an edge |
| NodePair | |
| NodePairEnergy | |
| NodeSet | |
| NodeSetPure | |
| NodeSetSimple | |
| NonPlanarCore | |
| NoStdComparerException | Exception thrown when a required standard comparer has not been specialized |
| Ogml | |
| OgmlParser | |
| OptimalHierarchyClusterLayout | The LP-based hierarchy cluster layout algorithm |
| OptimalHierarchyLayout | The LP-based hierarchy layout algorithm |
| OptimalRanking | The optimal ranking algorithm |
| OrderComparer | |
| OrthoLayout | |
| OrthoRep | |
| SideInfoUML | |
| VertexInfoUML | |
| OrthoShaper | |
| Overlap | |
| PALabel | Auxiliary class for the planar augmentation algorithm |
| ParticleInfo | |
| ParticleInfoComparer | |
| PertinentGraph | Pertinent graphs of nodes in an SPQR-tree |
| PlanarAugmentation | The algorithm for planar biconnectivity augmentation (Mutzel, Fialko) |
| PlanarAugmentationFix | The algorithm for biconnectivity augmentation with fixed combinatorial embedding |
| PlanarDrawLayout | Implementation of the Planar-Draw layout algorithm |
| PlanarGridLayoutModule | Base class for planar grid layout algorithms |
| Planarity | |
| ChangedCrossing | |
| PlanarityGrid | |
| PlanarityModule | Module for planarity testing and planar embeddings |
| PlanarizationGridLayout | The planarization grid layout algorithm |
| PlanarizationLayout | The planarization layout algorithm |
| PlanarLeafKey | |
| PlanarPQTree | |
| PlanarSPQRTree | SPQR-trees of planar graphs |
| PlanarStraightLayout | Implementation of the Planar-Straight layout algorithm |
| PlanarSubgraphModule | Interface for planar subgraph algorithms |
| PlanarSubgraphPQTree | |
| PlanRep | Planarized representations (of a connected component) of a graph |
| Deg1RestoreInfo | Information for restoring degree-1 nodes |
| PlanRepExpansion | Planarized representations (of a connected component) of a graph |
| Crossing | |
| NodeSplit | Representation of a node split in a planarized expansion |
| PlanRepInc | |
| PlanRepUML | |
| PointComparer | |
| PoolMemoryAllocator | The class PoolAllocator represents ogdf's pool memory allocator |
| MemElem | |
| MemElemEx | |
| PQBasicKey | |
| PQBasicKeyRoot | |
| PQInternalKey | |
| PQInternalNode | |
| PQLeaf | |
| PQLeafKey | |
| PQNode | |
| PQNodeKey | |
| PQNodeRoot | |
| PQTree | |
| PreconditionViolatedException | Exception thrown when preconditions are violated |
| PreprocessorLayout | The PreprocessorLayout removes multi-edges and self-loops |
| EdgeData | Deleted Edges are stored in EdgeData |
| Prioritized | Augments any data elements of type X with keys of type Score |
| ProcrustesPointSet | |
| ProcrustesSubLayout | A simple procrustes analysis implementation |
| QuadTreeNM | |
| QuadTreeNodeNM | |
| Queue | The parameterized class Queue<E> implements list-based queues |
| QueuePure | The parameterized class QueuePure<E> implements list-based queues |
| RadialTreeLayout | The radial tree layout algorithm |
| Group | |
| Grouping | |
| RandomMerger | |
| RandomPlacer | |
| RankingModule | Interface of algorithms for computing a node ranking |
| RCCrossings | |
| Repulsion | |
| RoutingChannel | |
| vInfo | |
| ScalingLayout | Scales a Graph relative to the ScalingType |
| SchnyderLayout | |
| ShellingOrder | The shelling order of a graph |
| ShellingOrderModule | Base class for modules that compute a shelling order of a graph |
| ShellingOrderSet | The node set in a shelling order of a graph |
| ShortestPathModule | |
| ShortestPathWithBFM | |
| SiftingHeuristic | The sifting heuristic for 2-layer crossing minimization |
| SimDraw | The Base class for simultaneous graph drawing |
| SimDrawCaller | Calls modified algorithms for simdraw instances |
| SimDrawColorizer | Adds color to a graph |
| SimDrawColorScheme | Manages the various color schemes |
| SimDrawCreator | Creates variety of possible SimDraw creations |
| SimDrawCreatorSimple | Offers predefined SimDraw creations |
| SimDrawManipulatorModule | Interface for simdraw manipulators |
| SimpleCluster | |
| SimpleEmbedder | Planar graph embedding by using default planarEmbed |
| SimpleIncNodeInserter | |
| Skeleton | Skeleton graphs of nodes in an SPQR-tree |
| Skiplist | A randomized skiplist |
| Element | Internal structure to hold the items and internal forward pointers of the skiplist |
| SkiplistIterator | Forward-Iterator for Skiplists |
| SList | The parameterized class SList<E> represents singly linked lists with content type E |
| SListConstIterator | The parameterized class SListIterator<E> encapsulates a constant pointer to an slist element |
| SListElement | The parameterized class SListElement<E> represents the structure for elements of singly linked lists |
| SListIterator | The parameterized class SListIterator<E> encapsulates a pointer to an slist element |
| SListPure | The parameterized class SListPure<E> represents singly linked lists with content type E |
| SolarMerger | |
| PathData | |
| SolarPlacer | |
| SplitHeuristic | The split heuristic for 2-layer crossing minimization |
| SPQRTree | Linear-time implementation of static SPQR-trees |
| SpringEmbedderFR | The spring-embedder layout algorithm by Fruchterman and Reingold |
| SpringEmbedderFRExact | |
| ArrayGraph | |
| SpringEmbedderKK | The spring-embedder layout algorithm by Kamada and Kawai |
| Stack | The parameterized class Stack<E> implements list-based stacks |
| StackPure | List-based stacks |
| Element | |
| StaticPlanarSPQRTree | SPQR-trees of planar graphs |
| StaticSkeleton | Skeleton graphs of nodes in a static SPQR-tree |
| StaticSPQRTree | Linear-time implementation of static SPQR-trees |
| StdComparer | Standard comparer (valid as a static comparer) |
| StdComparer< bool > | Generates a specialization of the standard static comparer for booleans |
| SteinLibParser | Reads a SteinLib file and converts it into a weighted graph and a set of terminal nodes |
| StressMajorization | |
| String | Representation of character strings |
| Sub | |
| SubgraphPlanarizer | The planarization approach for crossing minimization |
| CrossingStructure | |
| SubgraphUpwardPlanarizer | |
| SugiyamaLayout | Sugiyama's layout algorithm |
| System | System specific functionality |
| TargetComparer | A static comparer which compares the target of pointers ("content"), instead of the pointer's adresses |
| Thread | |
| TileToRowsCCPacker | The tile-to-rows algorithm for packing drawings of connected components |
| Timeouter | Class for timeout funtionality |
| Top10Heap | A variant of BinaryHeapSimple which always holds only the X (e.g. X=10) elements with the highest keys |
| TopologyModule | |
| TreeLayout | The tree layout algorithm |
| TriconnectedShellingOrder | |
| Tuple2 | Tuples of two elements (2-tuples) |
| Tuple3 | Tuples of three elements (3-tuples) |
| Tuple4 | Tuples of four elements (4-tuples) |
| TutteLayout | |
| TwoLayerCrossMin | Interface of two-layer crossing minimization algorithms |
| TwoLayerCrossMinSimDraw | |
| UMLGraph | |
| AssociationClass | |
| CliqueInfo | |
| UMLLayoutModule | Interface of UML layout algorithms |
| UniformGrid | |
| UPRLayoutModule | Interface of hierarchy layout algorithms |
| UpwardEdgeInserterModule | |
| UpwardPlanarizationLayout | |
| UpwardPlanarizerModule | Interface for upward planarization algorithms |
| UpwardPlanarModule | |
| DegreeInfo | |
| UpwardPlanarSubgraphModule | Interface for algorithms for computing an upward planar subgraph |
| UpwardPlanarSubgraphSimple | |
| UpwardPlanRep | Upward planarized representations (of a connected component) of a graph. The upward planarization representation is a single source single sink graph. The single source is s_hat and the single sink is t_hat. s_hat is connected with the sources of the original graph. This muss be done before creating of a instance of UpwardPlanRep. The super sink t_hat is contructed in this class. For technical reason we contruct a sink t and connect the sink of the original graph with t. Then we connect t with t_hat. The edge (t,t_hat) is called the external face handle. Because the right face of the adjEntry of this edge should be the external face |
| VariableEmbeddingInserter | Optimal edge insertion module |
| VariableEmbeddingInserter2 | |
| VComparer | Abstract base class for comparer classes |
| VisibilityLayout | |
| EdgeSegment | |
| NodeSegment | |
| WeightComparer | |
| whaInfo | |
| WInfo | Saves information about a pertinent node w between two stopping vertices |
| XmlAttributeObject | |
| XmlObject | |
| XmlParser | |
| XmlTagObject | |
| ZeroPlacer | |
