|
|||
|
|
|
|||
|
|
The namespace for all OGDF objects. More...
Classes | |
| class | AcyclicSubgraphModule |
| Base class of algorithms for computing a maximal acyclic subgraph. More... | |
| class | AddNodeComparer |
| Node comparer for sorting by decreasing int values. More... | |
| class | AdjacencyOracle |
| Tells you in linear time if two nodes are adjacent. More... | |
| class | AdjElement |
| Class for adjacency list elements. More... | |
| class | AdjEntryArray |
| Dynamic arrays indexed with adjacency entries. More... | |
| class | AdjEntryArrayBase |
| Abstract base class for adjacency entry arrays. More... | |
| class | AlgorithmFailureException |
| Exception thrown when an algorithm realizes an internal bug that prevents it from continuing. More... | |
| struct | AnyOption |
| class | Array |
| The parameterized class Array<E,INDEX> implements dynamic arrays of type E. More... | |
| class | Array2D |
| The parameterized class Array2D<E> implements dynamic two-dimensional arrays. More... | |
| class | ArrayBuffer |
| An array that keeps track of the number of inserted elements; also usable as an efficient stack. More... | |
| class | Attraction |
| Energy function for attraction between two adjacent vertices. More... | |
| class | AugmentationModule |
| The base class for graph augmentation algorithms. More... | |
| class | BalloonLayout |
| class | Barrier |
| Representation of a barrier. More... | |
| class | BarycenterHeuristic |
| The barycenter heuristic for 2-layer crossing minimization. More... | |
| class | BarycenterPlacer |
| class | BaseConstraint |
| Basic constraint type. More... | |
| class | BasicPageRank |
| Basic page rank calculation. More... | |
| class | BCTree |
| Static BC-trees. More... | |
| class | BendString |
| class | BiconnectedShellingOrder |
| Computation of the shelling order for biconnected graphs. More... | |
| class | BinaryHeap |
| class | BinaryHeap2 |
| Min-heap priority queue realized by a data array. More... | |
| class | BinaryHeapSimple |
| Dynamically growing binary heap tuned for efficiency on a small interface (compared to BinaryHeap). More... | |
| class | BoothLueker |
| Booth-Lueker planarity test. More... | |
| class | BoundedQueue |
| The parameterized class BoundedQueue<E,INDEX> implements queues with bounded size. More... | |
| class | BoundedStack |
| The parameterized class BoundedStack<E,INDEX> implements stacks with bounded size. More... | |
| class | BoyerMyrvold |
| Wrapper class used for preprocessing and valid invocation of the planarity test. More... | |
| class | BoyerMyrvoldInit |
| This class is used in the Boyer-Myrvold planarity test for preprocessing purposes. More... | |
| class | BoyerMyrvoldPlanar |
| This class implements the extended BoyerMyrvold planarity embedding algorithm. More... | |
| class | BucketEdgeArray |
| Bucket function for edges. More... | |
| class | BucketFunc |
| Abstract base class for bucket functions. More... | |
| class | BucketLowPoint |
| BucketFunction for lowPoint buckets. More... | |
| class | BucketSourceIndex |
| Bucket function using the index of an edge's source node as bucket. More... | |
| class | BucketTargetIndex |
| Bucket function using the index of an edge's target node as bucket. More... | |
| class | CCLayoutPackModule |
| Base class of algorithms that arrange/pack layouts of connected components. More... | |
| class | CconnectClusterPlanar |
| class | CconnectClusterPlanarEmbed |
| class | ChunkConnection |
| class | CirclePlacer |
| class | CircularLayout |
| The circular layout algorithm. More... | |
| class | CliqueFinder |
| Finds cliques and dense subgraphs. More... | |
| class | ClusterArray |
| Dynamic arrays indexed with clusters. More... | |
| class | ClusterArrayBase |
| Abstract base class for cluster arrays. More... | |
| class | ClusterElement |
| Representation of clusters in a clustered graph. More... | |
| class | Clusterer |
| class | ClustererModule |
| Interface for algorithms that compute a clustering for a given graph. More... | |
| class | ClusterGraph |
| Representation of clustered graphs. More... | |
| class | ClusterGraphAttributes |
| Stores additional attributes of a clustered graph (like layout information). More... | |
| class | ClusterGraphCopy |
| class | ClusterGraphCopyAttributes |
| Manages access on copy of an attributed clustered graph. More... | |
| class | ClusterGraphObserver |
| class | ClusterInfo |
| Stores information associated with a cluster. More... | |
| class | ClusterOrthoLayout |
| class | ClusterOrthoShaper |
| class | ClusterPlanarizationLayout |
| The cluster planarization layout algorithm. More... | |
| class | ClusterPlanRep |
| class | ClusterPQContainer |
| class | ClusterSet |
| class | ClusterSetPure |
| class | ClusterSetSimple |
| class | CoffmanGrahamRanking |
| The coffman graham ranking algorithm. More... | |
| class | CoinCallbacks |
| class | CoinManager |
| class | CombinatorialEmbedding |
| Combinatorial embeddings of planar graphs with modification functionality. More... | |
| class | CompactionConstraintGraph |
| class | CompactionConstraintGraphBase |
| class | ComponentSplitterLayout |
| struct | CompressionOption |
| class | ConnectedSubgraph |
| class | ConstCombinatorialEmbedding |
| Combinatorial embeddings of planar graphs. More... | |
| class | Constraint |
| class | ConstraintManager |
| class | ConvexHull |
| class | CPlanarEdgeInserter |
| class | CPlanarSubClusteredGraph |
| Constructs a c-planar subclustered graph of the input on base of a spanning tree. More... | |
| class | CPlanarSubClusteredST |
| Constructs a c-planar subclustered spanning tree of the input by setting edgearray values. More... | |
| class | CPlanarSubgraphModule |
| Interface of algorithms for the computation of c-planar subgraphs. More... | |
| class | CriticalSection |
| Representation of a critical section. More... | |
| class | CrossingMinimizationModule |
| Interface for crossing minimization algorithms. More... | |
| class | CrossingsMatrix |
| class | CutConstraint |
| class | DavidsonHarel |
| The Davidson-Harel approach for drawing graphs. More... | |
| class | DavidsonHarelLayout |
| The Davidson-Harel layout algorithm. More... | |
| class | DefHashFunc |
| Default hash functions. More... | |
| class | DefHashFunc< double > |
| Specialized default hash function for double. More... | |
| class | DefHashFunc< IPoint > |
| class | DefHashFunc< String > |
| class | DefHashFunc< void * > |
| Specialized default hash function for pointer types. More... | |
| class | DeletingTop10Heap |
| A variant of Top10Heap which deletes the elements that get rejected from the heap. More... | |
| class | DfsAcyclicSubgraph |
| DFS-based algorithm for computing a maximal acyclic subgraph. More... | |
| class | DfsMakeBiconnected |
| Implementation of a DFS-based algorithm for biconnectivity augmentation. More... | |
| class | Dijkstra |
| Dijkstra's single source shortest path algorithm. More... | |
| class | DinoLineBuffer |
| class | DinoLineBufferPosition |
| class | DinoTools |
| class | DinoUmlDiagramGraph |
| class | DinoUmlModelGraph |
| class | DinoUmlToGraphConverter |
| class | DinoXmlParser |
| class | DinoXmlScanner |
| class | DisjointSets |
| A Union/Find data structure for maintaining disjoint sets. More... | |
| class | DLine |
| Lines with real coordinates. More... | |
| class | DominanceLayout |
| class | DPoint |
| Real points. More... | |
| class | DPolygon |
| Polygons with real coordinates. More... | |
| class | DPolyline |
| Polylines with real coordinates. More... | |
| class | DRect |
| Rectangles with real coordinates. More... | |
| class | DScaler |
| Scaling between coordinate systems. More... | |
| class | DSegment |
| Line segments with real coordinates. More... | |
| class | DualGraph |
| A dual graph including its combinatorial embedding of an embedded graph. More... | |
| class | DVector |
| Vectors with real coordinates. More... | |
| class | DynamicBacktrack |
| Extracts all possible paths with backtracking using given edges and special constraints. More... | |
| class | DynamicBCTree |
| Dynamic BC-trees. More... | |
| class | DynamicCastFailedException |
| Exception thrown when result of cast is 0. More... | |
| class | DynamicPlanarSPQRTree |
| SPQR-trees of planar graphs. More... | |
| class | DynamicSkeleton |
| Skeleton graphs of nodes in a dynamic SPQR-tree. More... | |
| class | DynamicSPQRForest |
| Dynamic SPQR-forest. More... | |
| class | DynamicSPQRTree |
| Linear-time implementation of dynamic SPQR-trees. More... | |
| class | EdgeArray |
| Dynamic arrays indexed with edges. More... | |
| class | EdgeArrayBase |
| Abstract base class for edge arrays. More... | |
| class | EdgeAttributes |
| class | EdgeComparer |
| The EdgeComparer compares adjacency entries on base of the position of the nodes given by an Attributed Graph's layout information. More... | |
| class | EdgeComparerSimple |
| class | EdgeCoverMerger |
| class | EdgeElement |
| Class for the representation of edges. More... | |
| class | EdgeInsertionModule |
| Interface for edge insertion algorithms. More... | |
| class | EdgeLabel |
| class | EdgeLeg |
| class | EdgeRouter |
| struct | edgeValue |
| class | EdgeVar |
| class | EdgeWeightedGraph |
| class | EdgeWeightedGraphCopy |
| class | EFreeList |
| Simple implementation of a FreeList which buffers the memory allocation of an embedded list item. More... | |
| class | EFreeListIndexPool |
| More complex implementation of a FreeList, which is able to generate indeices for the elements. More... | |
| class | EFreeListTypes |
| Type declarations for EFreeList. More... | |
| class | ELabelInterface |
| class | ELabelPos |
| class | ELabelPosSimple |
| class | EList |
| The embedded list template. More... | |
| class | EListIterator |
| Implementation of an embedded list iterator used by EList. More... | |
| class | EmbedderMaxFace |
| Planar graph embedding with maximum external face. More... | |
| class | EmbedderMaxFaceBiconnectedGraphs |
| Computes an embedding of a biconnected graph with maximum external face. More... | |
| class | EmbedderMaxFaceBiconnectedGraphsLayers |
| Computes an embedding of a biconnected graph with maximum external face (plus layers approach). More... | |
| class | EmbedderMaxFaceLayers |
| Planar graph embedding with maximum external face (plus layers approach). More... | |
| class | EmbedderMinDepth |
| Planar graph embedding with minimum block-nesting depth. More... | |
| class | EmbedderMinDepthMaxFace |
| Planar graph embedding with minimum block-nesting depth and maximum external face. More... | |
| class | EmbedderMinDepthMaxFaceLayers |
| Planar graph embedding with minimum block-nesting depth and maximum external face (plus layers approach). More... | |
| class | EmbedderMinDepthPiTa |
| Planar graph embedding with minimum block-nesting depth for given embedded blocks. More... | |
| class | EmbedderModule |
| Base class for embedder algorithms. More... | |
| class | EmbedIndicator |
| class | EmbedPQTree |
| class | EnergyFunction |
| The interface for energy functions for the Davidson Harel graph drawing method. More... | |
| class | ENGLayer |
| class | EStack |
| The embedded stack class template. More... | |
| class | Exception |
| Base class of all ogdf exceptions. More... | |
| class | ExpansionGraph |
| class | ExtendedNestingGraph |
| struct | ExternE |
| List of externally active nodes strictly between x and y for minortypes B and E. More... | |
| class | ExtractKuratowskis |
| Extracts multiple Kuratowski Subdivisions. More... | |
| class | FaceArray |
| Dynamic arrays indexed with faces of a combinatorial embedding. More... | |
| class | FaceArrayBase |
| Abstract base class for face arrays. More... | |
| class | FaceElement |
| Faces in a combinatorial embedding. More... | |
| class | FaceSet |
| maintains a subset S of the faces contained in an associated combinatorial embedding E More... | |
| class | FaceSetPure |
| maintains a subset S of the faces contained in an associated combinatorial embedding E More... | |
| class | FaceSetSimple |
| Maintains a subset S of the faces contained in an associated combinatorial embedding E. More... | |
| class | FaceSinkGraph |
| class | FastHierarchyLayout |
| Coordinate assignment phase for the Sugiyama algorithm by Buchheim et al.. More... | |
| class | FastMultipoleEmbedder |
| class | FastMultipoleMultilevelEmbedder |
| class | FastPlanarSubgraph |
| Computation of a planar subgraph using PQ-trees. More... | |
| class | FastSimpleHierarchyLayout |
| Coordinate assignment phase for the Sugiyama algorithm by Ulrik Brandes and Boris Köpf. More... | |
| class | FeasibleUpwardPlanarSubgraph |
| class | FindKuratowskis |
| This class collects information about Kuratowski Subdivisions which is used for extraction later. More... | |
| class | FixedEmbeddingInserter |
| Edge insertion module that inserts each edge optimally into a fixed embedding. More... | |
| class | FixedEmbeddingUpwardEdgeInserter |
| Edge insertion module that inserts each edge optimally into a fixed embedding. More... | |
| class | FixedUpwardEmbeddingInserter |
| class | FlowCompaction |
| represents compaction algorithm using min-cost flow in the dual of the constraint graph More... | |
| class | FMMMLayout |
| The fast multipole multilevel layout algorithm. More... | |
| class | ForceLayoutModule |
| Interface of general layout algorithms. More... | |
| class | FPPLayout |
| class | FruchtermanReingold |
| class | FUPSModule |
| Interface for feasible upward planar subgraph algorithms. More... | |
| class | FUPSSimple |
| class | GEMLayout |
| The energy-based GEM layout algorithm. More... | |
| class | GenericPoint |
| Parameterized base class for points. More... | |
| struct | GmlObject |
| class | GmlParser |
| class | Graph |
| Data type for general directed graphs (adjacency list representation). More... | |
| class | GraphAttributes |
| Stores additional attributes of a graph (like layout information). More... | |
| class | GraphConstraints |
| class | GraphCopy |
| Copies of graphs supporting edge splitting. More... | |
| class | GraphCopyAttributes |
| class | GraphCopySimple |
| Copies of graphs with mapping between nodes and edges. More... | |
| class | GraphElement |
| The base class for objects used by graphs like nodes, edges, etc. More... | |
| class | GraphList |
| Lists of graph objects (like nodes, edges, etc.). More... | |
| class | GraphListBase |
| Base class for GraphElement lists. More... | |
| class | 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) More... | |
| class | GraphReduction |
| class | GreedyCycleRemoval |
| Greedy algorithm for computing a maximal acyclic subgraph. More... | |
| class | GreedyInsertHeuristic |
| The greedy-insert heuristic for 2-layer crossing minimization. More... | |
| class | GreedySwitchHeuristic |
| The greedy-switch heuristic for 2-layer crossing minimization. More... | |
| class | GridLayout |
| Representation of a graph's grid layout. More... | |
| class | GridLayoutMapped |
| class | GridLayoutModule |
| Base class for grid layout algorithms. More... | |
| class | GridLayoutPlanRepModule |
| Base class for grid layout algorithms operating on a PlanRep. More... | |
| class | HashArray |
| Indexed arrays using hashing for element access. More... | |
| class | HashArray2D |
| Indexed 2-dimensional arrays using hashing for element access. More... | |
| class | HashConstIterator |
| Iterators for hash tables. More... | |
| class | HashConstIterator2D |
| Const-iterator for 2D-hash arrays. More... | |
| class | HashElement |
| Representation of elements in a hash table. More... | |
| class | HashElementBase |
| Base class for elements within a hash table. More... | |
| class | HashFuncTuple |
| class | Hashing |
| Hashing with chaining and table doubling. More... | |
| class | HashingBase |
| Base class for hashing with chaining and table doubling. More... | |
| class | HeapBase |
| class | HeapElement |
| class | Hierarchy |
| Representation of proper hierarchies used by Sugiyama-layout. More... | |
| class | HierarchyClusterLayoutModule |
| Interface of hierarchy layout algorithms for cluster graphs. More... | |
| class | HierarchyLayoutModule |
| Interface of hierarchy layout algorithms. More... | |
| class | HyperGraph |
| class | HyperGraphTypes |
| Type declarations for HyperGraph. More... | |
| class | IncNodeInserter |
| class | IndependentSetMerger |
| class | IndInfo |
| class | Initialization |
| class | InitialPlacer |
| class | InsufficientMemoryException |
| Exception thrown when not enough memory is available to execute an algorithm. More... | |
| struct | InterleavingOption |
| class | IntersectionRectangle |
| class | IPoint |
| Integer points. More... | |
| class | IPolyline |
| Polylines with integer coordinates. More... | |
| class | KuratowskiConstraint |
| class | KuratowskiStructure |
| A Kuratowski Structure is a special graph structure containing severals subdivisions. More... | |
| class | KuratowskiSubdivision |
| class | KuratowskiWrapper |
| Wrapper-class for Kuratowski Subdivisions containing the minortype and edgelist. More... | |
| class | LayerBasedUPRLayout |
| class | Layout |
| Stores a layout of a graph (coordinates of nodes, bend points of edges). More... | |
| class | LayoutClusterPlanRepModule |
| Interface for planar cluster layout algorithms. More... | |
| class | LayoutModule |
| Interface of general layout algorithms. More... | |
| class | LayoutPlanRepModule |
| Interface for planar UML layout algorithms. More... | |
| class | Level |
| Representation of levels in hierarchies. More... | |
| class | LHTreeNode |
| class | LibraryNotSupportedException |
| Exception thrown when an external library shall be used which is not supported. More... | |
| struct | LinkOption |
| class | List |
| The parameterized class ListPure<E> represents doubly linked lists with content type E. More... | |
| class | ListConstIterator |
| The parameterized class ListIterator<E> encapsulates a constant pointer to a list element. More... | |
| class | ListElement |
| The parameterized class ListElement<E> represents the structure for elements of doubly linked lists. More... | |
| class | ListIterator |
| The parameterized class ListIterator<E> encapsulates a pointer to a dlist element. More... | |
| class | ListPure |
| The parameterized class ListPure<E> represents doubly linked lists with content type E. More... | |
| class | LocalBiconnectedMerger |
| class | Logger |
| Centralized global and local logging facility working on streams like cout. More... | |
| class | LongestPathCompaction |
| Compaction algorithm using longest paths in the constraint graph. More... | |
| class | LongestPathRanking |
| The longest-path ranking algorithm. More... | |
| class | LPSolver |
| class | MallocMemoryAllocator |
Implements a simple memory manager using malloc() and free(). More... | |
| class | Master |
| class | MatchingMerger |
| class | Math |
| class | MaximalPlanarSubgraphSimple |
| class | MaximumCPlanarSubgraph |
| Exact computation of a maximum c-planar subgraph. More... | |
| class | MaximumPlanarSubgraph |
| class | MaxPlanarEdgesConstraint |
| class | MaxSequencePQTree |
| class | MDMFLengthAttribute |
| class | MedianHeuristic |
| The median heuristic for 2-layer crossing minimization. More... | |
| class | MedianPlacer |
| class | MinCostFlowModule |
| Interface for min-cost flow algorithms. More... | |
| class | MinCostFlowReinelt |
| class | MinCut |
| class | MinimalClusterConnection |
| class | MinimumEdgeDistances |
| class | MinPriorityQueue |
| class | MixedForceLayout |
| class | MixedModelCrossingsBeautifierModule |
| The base class for Mixed-Model crossings beautifier algorithms. More... | |
| class | MixedModelLayout |
| Implementation of the Mixed-Model layout algorithm. More... | |
| class | MMCBBase |
| common base class for MMCBDoubleGrid and MMCBLocalStretch. More... | |
| class | MMCBDoubleGrid |
| Crossings beautifier using grid doubling. More... | |
| class | MMCBLocalStretch |
| Crossings beautifier using a local stretch strategy. More... | |
| class | MMCrossingMinimizationModule |
| Interface for minor-monotone crossing minimization algorithms. More... | |
| class | MMDummyCrossingsBeautifier |
| Dummy implementation of Mixed-Model crossings beautifier. More... | |
| class | MMEdgeInsertionModule |
| Interface for minor-monotone edge insertion algorithms. More... | |
| class | MMFixedEmbeddingInserter |
| Minor-monotone edge insertion with fixed embedding. More... | |
| class | MMMExampleFastLayout |
| An example Layout using the Modular Mutlievel Mixer. More... | |
| class | MMMExampleNiceLayout |
| An example Layout using the Modular Mutlievel Mixer. More... | |
| class | MMMExampleNoTwistLayout |
| An example Layout using the Modular Mutlievel Mixer. More... | |
| class | MMSubgraphPlanarizer |
| Planarization approach for minor-monotone crossing minimization. More... | |
| class | MMVariableEmbeddingInserter |
| Minor-monotone edge insertion with variable embedding. More... | |
| class | ModularMultilevelMixer |
| Modular multilevel graph layout. More... | |
| class | Module |
| Base class for modules. More... | |
| class | ModuleOption |
| The parameterized base class for module options. More... | |
| class | MultiEdgeApproxInserter |
| class | MultilevelBuilder |
| class | MultilevelGraph |
| class | MultilevelLayout |
| class | MultilevelLayoutModule |
| Interface of general layout algorithms that also allow a MultilevelGraph as call parameter, extending the interface of a simple LayoutModule. More... | |
| class | NearestRectangleFinder |
| class | NMM |
| class | NodeArray |
| Dynamic arrays indexed with nodes. More... | |
| class | NodeArrayBase |
| Abstract base class for node arrays. More... | |
| class | NodeAttributes |
| class | NodeComparer |
| class | NodeElement |
| Class for the representation of nodes. More... | |
| class | NodeInfo |
| struct | NodeMerge |
| struct | nodePair |
| Struct for storing the two corresponding nodes of an edge. More... | |
| class | NodePair |
| class | NodePairEnergy |
| class | NodeSet |
| class | NodeSetPure |
| class | NodeSetSimple |
| class | NonPlanarCore |
| class | NoStdComparerException |
| Exception thrown when a required standard comparer has not been specialized. More... | |
| class | Ogml |
| class | OgmlParser |
| class | OptimalHierarchyClusterLayout |
| The LP-based hierarchy cluster layout algorithm. More... | |
| class | OptimalHierarchyLayout |
| The LP-based hierarchy layout algorithm. More... | |
| class | OptimalRanking |
| The optimal ranking algorithm. More... | |
| class | OrderComparer |
| class | OrthoLayout |
| class | OrthoRep |
| class | OrthoShaper |
| class | Overlap |
| class | PALabel |
| auxiliary class for the planar augmentation algorithm More... | |
| class | ParticleInfo |
| class | ParticleInfoComparer |
| class | PertinentGraph |
| Pertinent graphs of nodes in an SPQR-tree. More... | |
| class | PlanarAugmentation |
| The algorithm for planar biconnectivity augmentation (Mutzel, Fialko). More... | |
| class | PlanarAugmentationFix |
| The algorithm for biconnectivity augmentation with fixed combinatorial embedding. More... | |
| class | PlanarDrawLayout |
| Implementation of the Planar-Draw layout algorithm. More... | |
| class | PlanarGridLayoutModule |
| Base class for planar grid layout algorithms. More... | |
| class | Planarity |
| class | PlanarityGrid |
| class | PlanarityModule |
| Module for planarity testing and planar embeddings. More... | |
| class | PlanarizationGridLayout |
| The planarization grid layout algorithm. More... | |
| class | PlanarizationLayout |
| The planarization layout algorithm. More... | |
| class | PlanarLeafKey |
| class | PlanarPQTree |
| class | PlanarSPQRTree |
| SPQR-trees of planar graphs. More... | |
| class | PlanarStraightLayout |
| Implementation of the Planar-Straight layout algorithm. More... | |
| class | PlanarSubgraphModule |
| Interface for planar subgraph algorithms. More... | |
| class | PlanarSubgraphPQTree |
| class | PlanRep |
| Planarized representations (of a connected component) of a graph. More... | |
| class | PlanRepExpansion |
| Planarized representations (of a connected component) of a graph. More... | |
| class | PlanRepInc |
| class | PlanRepUML |
| class | PointComparer |
| class | PoolMemoryAllocator |
| The class PoolAllocator represents ogdf's pool memory allocator. More... | |
| class | PQBasicKey |
| class | PQBasicKeyRoot |
| class | PQInternalKey |
| class | PQInternalNode |
| class | PQLeaf |
| class | PQLeafKey |
| class | PQNode |
| class | PQNodeKey |
| class | PQNodeRoot |
| class | PQTree |
| class | PreconditionViolatedException |
| Exception thrown when preconditions are violated. More... | |
| class | PreprocessorLayout |
| The PreprocessorLayout removes multi-edges and self-loops. More... | |
| class | Prioritized |
| Augments any data elements of type X with keys of type Score. More... | |
| class | ProcrustesPointSet |
| class | ProcrustesSubLayout |
| A simple procrustes analysis implementation. More... | |
| class | QuadTreeNM |
| class | QuadTreeNodeNM |
| class | Queue |
| The parameterized class Queue<E> implements list-based queues. More... | |
| class | QueuePure |
| The parameterized class QueuePure<E> implements list-based queues. More... | |
| class | RadialTreeLayout |
| The radial tree layout algorithm. More... | |
| class | RandomMerger |
| class | RandomPlacer |
| class | RankingModule |
| Interface of algorithms for computing a node ranking. More... | |
| struct | RCCrossings |
| class | Repulsion |
| class | RoutingChannel |
| class | ScalingLayout |
| Scales a Graph relative to the ScalingType. More... | |
| class | SchnyderLayout |
| class | ShellingOrder |
| The shelling order of a graph. More... | |
| class | ShellingOrderModule |
| Base class for modules that compute a shelling order of a graph. More... | |
| class | ShellingOrderSet |
| The node set in a shelling order of a graph. More... | |
| class | ShortestPathModule |
| class | ShortestPathWithBFM |
| class | SiftingHeuristic |
| The sifting heuristic for 2-layer crossing minimization. More... | |
| class | SimDraw |
| The Base class for simultaneous graph drawing. More... | |
| class | SimDrawCaller |
| Calls modified algorithms for simdraw instances. More... | |
| class | SimDrawColorizer |
| Adds color to a graph. More... | |
| class | SimDrawCreator |
| Creates variety of possible SimDraw creations. More... | |
| class | SimDrawCreatorSimple |
| Offers predefined SimDraw creations. More... | |
| class | SimDrawManipulatorModule |
| Interface for simdraw manipulators. More... | |
| class | SimpleCluster |
| class | SimpleEmbedder |
| Planar graph embedding by using default planarEmbed. More... | |
| class | SimpleIncNodeInserter |
| class | Skeleton |
| Skeleton graphs of nodes in an SPQR-tree. More... | |
| class | Skiplist |
| A randomized skiplist. More... | |
| class | SkiplistIterator |
| Forward-Iterator for Skiplists. More... | |
| class | SList |
| The parameterized class SList<E> represents singly linked lists with content type E. More... | |
| class | SListConstIterator |
| The parameterized class SListIterator<E> encapsulates a constant pointer to an slist element. More... | |
| class | SListElement |
| The parameterized class SListElement<E> represents the structure for elements of singly linked lists. More... | |
| class | SListIterator |
| The parameterized class SListIterator<E> encapsulates a pointer to an slist element. More... | |
| class | SListPure |
| The parameterized class SListPure<E> represents singly linked lists with content type E. More... | |
| class | SolarMerger |
| class | SolarPlacer |
| class | SplitHeuristic |
| The split heuristic for 2-layer crossing minimization. More... | |
| class | SPQRTree |
| Linear-time implementation of static SPQR-trees. More... | |
| class | SpringEmbedderFR |
| The spring-embedder layout algorithm by Fruchterman and Reingold. More... | |
| class | SpringEmbedderFRExact |
| class | SpringEmbedderKK |
| The spring-embedder layout algorithm by Kamada and Kawai. More... | |
| class | Stack |
| The parameterized class Stack<E> implements list-based stacks. More... | |
| class | StackPure |
| List-based stacks. More... | |
| class | StaticPlanarSPQRTree |
| SPQR-trees of planar graphs. More... | |
| class | StaticSkeleton |
| Skeleton graphs of nodes in a static SPQR-tree. More... | |
| class | StaticSPQRTree |
| Linear-time implementation of static SPQR-trees. More... | |
| class | StdComparer |
| Standard comparer (valid as a static comparer). More... | |
| class | StdComparer< bool > |
| Generates a specialization of the standard static comparer for booleans. More... | |
| class | SteinLibParser |
| Reads a SteinLib file and converts it into a weighted graph and a set of terminal nodes. More... | |
| class | StressMajorization |
| class | String |
| Representation of character strings. More... | |
| class | Sub |
| class | SubgraphPlanarizer |
| The planarization approach for crossing minimization. More... | |
| class | SubgraphUpwardPlanarizer |
| class | SugiyamaLayout |
| Sugiyama's layout algorithm. More... | |
| class | System |
| System specific functionality. More... | |
| class | TargetComparer |
| A static comparer which compares the target of pointers ("content"), instead of the pointer's adresses. More... | |
| class | Thread |
| class | TileToRowsCCPacker |
| The tile-to-rows algorithm for packing drawings of connected components. More... | |
| class | Timeouter |
| class for timeout funtionality More... | |
| class | Top10Heap |
| A variant of BinaryHeapSimple which always holds only the X (e.g. X=10) elements with the highest keys. More... | |
| class | TopologyModule |
| class | TreeLayout |
| The tree layout algorithm. More... | |
| class | TriconnectedShellingOrder |
| class | Tuple2 |
| Tuples of two elements (2-tuples). More... | |
| class | Tuple3 |
| Tuples of three elements (3-tuples). More... | |
| class | Tuple4 |
| Tuples of four elements (4-tuples). More... | |
| class | TutteLayout |
| class | TwoLayerCrossMin |
| Interface of two-layer crossing minimization algorithms. More... | |
| class | TwoLayerCrossMinSimDraw |
| class | UMLGraph |
| class | UMLLayoutModule |
| Interface of UML layout algorithms. More... | |
| class | UniformGrid |
| class | UPRLayoutModule |
| Interface of hierarchy layout algorithms. More... | |
| class | UpwardEdgeInserterModule |
| class | UpwardPlanarizationLayout |
| class | UpwardPlanarizerModule |
| Interface for upward planarization algorithms. More... | |
| class | UpwardPlanarModule |
| class | UpwardPlanarSubgraphModule |
| Interface for algorithms for computing an upward planar subgraph. More... | |
| class | UpwardPlanarSubgraphSimple |
| class | 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. More... | |
| class | VariableEmbeddingInserter |
| Optimal edge insertion module. More... | |
| class | VariableEmbeddingInserter2 |
| class | VComparer |
| Abstract base class for comparer classes. More... | |
| class | VisibilityLayout |
| class | WeightComparer |
| class | whaInfo |
| struct | WInfo |
| Saves information about a pertinent node w between two stopping vertices. More... | |
| struct | XmlAttributeObject |
| struct | XmlObject |
| class | XmlParser |
| struct | XmlTagObject |
| class | ZeroPlacer |
Typedefs | |
| typedef AdjElement * | adjEntry |
| The type of adjacency entries. | |
| typedef ClusterElement * | cluster |
| The type of clusters. | |
| typedef EdgeElement * | edge |
| The type of edges. | |
| typedef long | edgeType |
| typedef FaceElement * | face |
| typedef HashElement< String, int > * | GmlKey |
| typedef HashElement< String, int > | HashedString |
| typedef NodeElement * | node |
| The type of nodes. | |
| typedef long | nodeType |
| typedef PALabel * | pa_label |
| typedef PlanarLeafKey< IndInfo * > * | PtrPlanarLeafKeyI |
| typedef PlanarLeafKey< whaInfo * > * | PtrPlanarLeafKeyW |
| typedef PQBasicKey< edge, IndInfo *, bool > * | PtrPQBasicKeyEIB |
| typedef PQLeafKey< edge, whaInfo *, bool > * | PtrPQLeafKeyEWB |
| typedef HashElement< String, int > * | XmlKey |
Functions | |
| int | biconnectedComponents (const Graph &G, EdgeArray< int > &component) |
| Computes the biconnected components of G. | |
| template<class E > | |
| void | bucketSort (Array< E > &a, int min, int max, BucketFunc< E > &f) |
| bool | changeDir (const char *dirName) |
| Changes current directory to dirName; returns true if successful. | |
| void | completeBipartiteGraph (Graph &G, int n, int m) |
| Creates t complete bipartite graph \(K_{n,m}\). | |
| void | completeGraph (Graph &G, int n) |
| Creates the complete graph \(K_n\). | |
| template<typename T > | |
| T | computeMinST (const Graph &G, const EdgeArray< T > &weight, EdgeArray< bool > &isInTree) |
| Computes a minimum spanning tree using Prim's algorithm. | |
| template<typename T > | |
| T | computeMinST (const Graph &G, const EdgeArray< T > &weight, NodeArray< edge > &pred, EdgeArray< bool > &isInTree) |
| Computes a minimum spanning tree (MST) using Prim's algorithm. | |
| template<typename T > | |
| T | computeMinST (node s, const Graph &G, const EdgeArray< T > &weight, NodeArray< edge > &pred, EdgeArray< bool > &isInTree) |
| Computes a minimum spanning tree (MST) using Prim's algorithm. | |
| int | connectedComponents (const Graph &G, NodeArray< int > &component) |
| Computes the connected components of G. | |
| int | connectedIsolatedComponents (const Graph &G, List< node > &isolated, NodeArray< int > &component) |
| Computes the connected components of G and returns the list of isolated nodes. | |
| void | cubeGraph (Graph &G, int n) |
| Creates the graph \(Q^n\): A n-cube graph. | |
| bool | dfsGenTree (UMLGraph &UG, List< edge > &fakedGens, bool fakeTree) |
| bool | dfsGenTreeRec (UMLGraph &UG, EdgeArray< bool > &used, NodeArray< int > &hierNumber, int hierNum, node v, List< edge > &fakedGens, bool fakeTree) |
| bool | DIsEqual (const double &a, const double &b, const double eps=OGDF_GEOM_EPS) |
| bool | DIsGreater (const double &a, const double &b, const double eps=OGDF_GEOM_EPS) |
| bool | DIsGreaterEqual (const double &a, const double &b, const double eps=OGDF_GEOM_EPS) |
| bool | DIsLess (const double &a, const double &b, const double eps=OGDF_GEOM_EPS) |
| bool | DIsLessEqual (const double &a, const double &b, const double eps=OGDF_GEOM_EPS) |
| template<class E > | |
| bool | doDestruction (const E *) |
| template<> | |
| bool | doDestruction (const char *) |
| template<> | |
| bool | doDestruction< adjEntry > (const adjEntry *) |
| template<> | |
| bool | doDestruction< double > (const double *) |
| template<> | |
| bool | doDestruction< edge > (const edge *) |
| template<> | |
| bool | doDestruction< int > (const int *) |
| template<> | |
| bool | doDestruction< node > (const node *) |
| template<> | |
| bool | doDestruction< PtrPlanarLeafKeyI > (const PtrPlanarLeafKeyI *) |
| template<> | |
| bool | doDestruction< PtrPlanarLeafKeyW > (const PtrPlanarLeafKeyW *) |
| template<> | |
| bool | doDestruction< PtrPQBasicKeyEIB > (const PtrPQBasicKeyEIB *) |
| template<> | |
| bool | doDestruction< PtrPQLeafKeyEWB > (const PtrPQLeafKeyEWB *) |
| double | DRound (const double &d, int prec=0) |
| edge | firstOutGen (UMLGraph &UG, node v, EdgeArray< bool > &) |
| void | getEntries (const char *dirName, List< String > &entries, const char *pattern="*") |
| Returns in entries the list of all entries contained in directory dirName. | |
| void | getEntries (const char *dirName, FileType t, List< String > &entries, const char *pattern="*") |
| Returns in entries the list of all entries of type t contained in directory dirName. | |
| void | getEntriesAppend (const char *dirName, List< String > &entries, const char *pattern="*") |
| Appends to entries the list of all entries contained in directory dirName. | |
| void | getEntriesAppend (const char *dirName, FileType t, List< String > &entries, const char *pattern="*") |
| Appends to entries the list of all entries of type t contained in directory dirName. | |
| void | getFiles (const char *dirName, List< String > &files, const char *pattern="*") |
| Returns in files the list of files in directory dirName. | |
| void | getFilesAppend (const char *dirName, List< String > &files, const char *pattern="*") |
| Appends to files the list of files in directory dirName. | |
| template<class EDGELIST > | |
| void | getParallelFreeUndirected (const Graph &G, EdgeArray< EDGELIST > ¶llelEdges) |
| Computes the bundles of undirected parallel edges in G. | |
| void | getSubdirs (const char *dirName, List< String > &subdirs, const char *pattern="*") |
| Returns in subdirs the list of directories contained in directory dirName. | |
| void | getSubdirsAppend (const char *dirName, List< String > &subdirs, const char *pattern="*") |
| Appends to subdirs the list of directories contained in directory dirName. | |
| void | gridGraph (Graph &G, int n, int m, bool loopN, bool loopM) |
| Creates a (toroidal) grid graph on n x m nodes. | |
| bool | hasSingleSink (const Graph &G, node &sink) |
| Returns true iff the digraph G contains exactly one sink node (or is empty). | |
| bool | hasSingleSink (const Graph &G) |
| Returns true iff the digraph G contains exactly one sink node (or is empty). | |
| bool | hasSingleSource (const Graph &G, node &source) |
| Returns true iff the digraph G contains exactly one source node (or is empty). | |
| bool | hasSingleSource (const Graph &G) |
| Returns true iff the digraph G contains exactly one source node (or is empty). | |
| template<class LISTITERATOR > | |
| void | inducedSubGraph (const Graph &G, LISTITERATOR start, Graph &subGraph) |
| Computes the subgraph induced by a list of nodes. | |
| template<class LISTITERATOR > | |
| void | inducedSubGraph (const Graph &G, LISTITERATOR start, Graph &subGraph, NodeArray< node > &nodeTableOrig2New) |
| Computes the subgraph induced by a list of nodes (plus a mapping from original nodes to new copies). | |
| template<class LISTITERATOR > | |
| void | inducedSubGraph (const Graph &G, LISTITERATOR start, Graph &subGraph, NodeArray< node > &nodeTableOrig2New, EdgeArray< edge > &edgeTableOrig2New) |
| Computes the subgraph induced by a list of nodes (plus mappings from original nodes and edges to new copies). | |
| template<class NODELISTITERATOR , class EDGELIST > | |
| void | inducedSubgraph (Graph &G, NODELISTITERATOR &it, EDGELIST &E) |
| Computes the edges in a node-induced subgraph. | |
| bool | isAcyclic (const Graph &G, List< edge > &backedges) |
| Returns true iff the digraph G is acyclic. | |
| bool | isAcyclic (const Graph &G) |
| Returns true iff the digraph G is acyclic. | |
| bool | isAcyclicUndirected (const Graph &G, List< edge > &backedges) |
| Returns true iff the undirected graph G is acyclic. | |
| bool | isAcyclicUndirected (const Graph &G) |
| Returns true iff the undirected graph G is acyclic. | |
| bool | isBiconnected (const Graph &G, node &cutVertex) |
| Returns true iff G is biconnected. | |
| bool | isBiconnected (const Graph &G) |
| Returns true iff G is biconnected. | |
| bool | isCConnected (const ClusterGraph &C) |
| Returns true iff cluster graph C is c-connected. | |
| bool | isConnected (const Graph &G) |
| Returns true iff G is connected. | |
| bool | isDirectory (const char *fileName) |
| Returns true iff fileName is a directory. | |
| bool | isFile (const char *fileName) |
| Returns true iff fileName is a regular file (not a directory). | |
| bool | isForest (const Graph &G, List< node > &roots) |
| Returns true iff G represents a forest, i.e., a collection of rooted trees. | |
| bool | isForest (const Graph &G) |
| Returns true iff G represents a forest, i.e. a collection of rooted trees. | |
| bool | isFreeForest (const Graph &G) |
| Returns true iff G is a free forest, i.e. contains no undirected cycle. | |
| bool | isLoopFree (const Graph &G) |
| Returns true iff G contains no self-loop. | |
| bool | isParallelFree (const Graph &G) |
| Returns true iff G contains no paralle edges. | |
| bool | isParallelFreeUndirected (const Graph &G) |
| Returns true iff G contains no undirected parallel edges. | |
| bool | isPlanar (const Graph &G) |
| Returns true, if G is planar, false otherwise. | |
| bool | isSimple (const Graph &G) |
| Returns true iff G contains neither self-loops nor parallel edges. | |
| bool | isSimpleUndirected (const Graph &G) |
| Returns true iff G contains neither self-loops nor undirected parallel edges. | |
| bool | isStGraph (const Graph &G, node &s, node &t, edge &st) |
| Returns true iff G is an st-digraph. | |
| bool | isStGraph (const Graph &G) |
| Returns true if G is an st-digraph. | |
| bool | isTree (const Graph &G, node &root) |
| Returns true iff G represents a tree. | |
| bool | isTree (const Graph &G) |
| Returns true iff G represents a tree. | |
| bool | isTriconnected (const Graph &G, node &s1, node &s2) |
| Returns true iff G is triconnected. | |
| bool | isTriconnected (const Graph &G) |
| Returns true iff G is triconnected. | |
| bool | isTriconnectedPrimitive (const Graph &G, node &s1, node &s2) |
| Returns true iff G is triconnected (using a quadratic time algorithm!). | |
| bool | isTriconnectedPrimitive (const Graph &G) |
| Returns true iff G is triconnected (using a quadratic time algorithm!). | |
| int | localtime (struct tm *ptm, const time_t *timer) |
| void | makeAcyclic (Graph &G) |
| Makes the digraph G acyclic by removing edges. | |
| void | makeAcyclicByReverse (Graph &G) |
| Makes the digraph G acyclic by reversing edges. | |
| void | makeBiconnected (Graph &G, List< edge > &added) |
| Makes G biconnected by adding edges. | |
| void | makeBiconnected (Graph &G) |
| Makes G biconnected by adding edges. | |
| void | makeCConnected (ClusterGraph &C, Graph &G, List< edge > &addedEdges, bool simple=true) |
| Makes a cluster graph c-connected by adding edges. | |
| void | makeConnected (Graph &G, List< edge > &added) |
| Makes G connected by adding a minimum number of edges. | |
| void | makeConnected (Graph &G) |
| makes G connected by adding a minimum number of edges. | |
| template<class NODELIST > | |
| void | makeLoopFree (Graph &G, NODELIST &L) |
| Removes all self-loops from G and returns all nodes with self-loops in L. | |
| void | makeLoopFree (Graph &G) |
| Removes all self-loops from G. | |
| template<class EDGELIST > | |
| void | makeParallelFree (Graph &G, EDGELIST ¶llelEdges) |
| Removes all but one of each bundle of parallel edges. | |
| void | makeParallelFree (Graph &G) |
| Removes all but one edge of each bundle of parallel edges in G. | |
| template<class EDGELIST > | |
| void | makeParallelFreeUndirected (Graph &G, EDGELIST ¶llelEdges) |
| Removes all but one of each bundle of undirected parallel edges. | |
| void | makeParallelFreeUndirected (Graph &G) |
| Removes all but one of each bundle of undirected parallel edges. | |
| template<class EDGELIST > | |
| void | makeParallelFreeUndirected (Graph &G, EDGELIST ¶llelEdges, EdgeArray< int > &cardPositive, EdgeArray< int > &cardNegative) |
| Removes all but one of each bundle of undirected parallel edges. | |
| void | makeSimple (Graph &G) |
| Removes all self-loops and all but one edge of each bundle of parallel edges. | |
| void | makeSimpleUndirected (Graph &G) |
| Removes all self-loops and all but one edge of each bundle of undirected parallel edges. | |
| int | numParallelEdges (const Graph &G) |
| Returns the number of parallel edges in G. | |
| int | numParallelEdgesUndirected (const Graph &G) |
| Returns the number of undirected parallel edges in G. | |
| bool | operator!= (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| template<class E1 , class E2 > | |
| bool | operator!= (const Tuple2< E1, E2 > &t1, const Tuple2< E1, E2 > &t2) |
| Inequality operator for 2-tuples. | |
| template<class E1 , class E2 , class E3 > | |
| bool | operator!= (const Tuple3< E1, E2, E3 > &t1, const Tuple3< E1, E2, E3 > &t2) |
| Inequality operator for 3-tuples. | |
| template<class E1 , class E2 , class E3 , class E4 > | |
| bool | operator!= (const Tuple4< E1, E2, E3, E4 > &t1, const Tuple4< E1, E2, E3, E4 > &t2) |
| Inequality operator for 4-tuples. | |
| MDMFLengthAttribute | operator+ (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| MDMFLengthAttribute | operator+= (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| MDMFLengthAttribute | operator- (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| MDMFLengthAttribute | operator-= (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| bool | operator< (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| ostream & | operator<< (ostream &os, ogdf::node v) |
| Output operator for nodes; prints node index (or "nil"). | |
| ostream & | operator<< (ostream &os, ogdf::edge e) |
| Output operator for edges; prints source and target indices (or "nil"). | |
| std::ostream & | operator<< (std::ostream &os, const nodePair &v) |
| ostream & | operator<< (ostream &os, ogdf::adjEntry adj) |
| Output operator for adjacency entries; prints node and twin indices (or "nil"). | |
| ostream & | operator<< (ostream &s, const MDMFLengthAttribute &x) |
| template<class E1 , class E2 > | |
| ostream & | operator<< (ostream &os, const Tuple2< E1, E2 > &t2) |
| Output operator for 2-tuples. | |
| ostream & | operator<< (ostream &os, const DinoUmlModelGraph &modelGraph) |
| ostream & | operator<< (ostream &os, const RCCrossings &cr) |
| template<class E1 , class E2 , class E3 > | |
| ostream & | operator<< (ostream &os, const Tuple3< E1, E2, E3 > &t3) |
| Output operator for 3-tuples. | |
| ostream & | operator<< (ostream &os, const IPoint &ip) |
| Output operator for integer points. | |
| ostream & | operator<< (ostream &os, const DinoUmlDiagramGraph &diagramGraph) |
| template<class E , class INDEX > | |
| ostream & | operator<< (ostream &os, const BoundedQueue< E, INDEX > &Q) |
| template<class E , class INDEX > | |
| ostream & | operator<< (ostream &os, const BoundedStack< E, INDEX > &S) |
| ostream & | operator<< (ostream &os, const String &str) |
| Output operator for strings. | |
| template<class E > | |
| ostream & | operator<< (ostream &os, const QueuePure< E > &Q) |
| template<class E > | |
| ostream & | operator<< (ostream &os, const Queue< E > &Q) |
| template<class E > | |
| ostream & | operator<< (ostream &os, const StackPure< E > &S) |
| template<class E > | |
| ostream & | operator<< (ostream &os, const Stack< E > &S) |
| template<class E1 , class E2 , class E3 , class E4 > | |
| ostream & | operator<< (ostream &os, const Tuple4< E1, E2, E3, E4 > &t4) |
| Output operator for 4-tuples. | |
| ostream & | operator<< (ostream &os, const DPoint &dp) |
| Output operator for real points. | |
| ostream & | operator<< (ostream &O, const NodeInfo &inf) |
| ostream & | operator<< (ostream &os, const DinoXmlParser &parser) |
| ostream & | operator<< (ostream &os, const DLine &dl) |
| Output operator for lines. | |
| template<class E , class INDEX > | |
| ostream & | operator<< (ostream &os, const ogdf::Array< E, INDEX > &a) |
| ostream & | operator<< (ostream &os, const DRect &dr) |
| Output operator for rectangles. | |
| ostream & | operator<< (ostream &os, const DScaler &ds) |
| Output operator for scalers. | |
| ostream & | operator<< (ostream &os, const DPolygon &dop) |
| Output operator for polygons. | |
| template<typename T > | |
| static std::ostream & | operator<< (std::ostream &outStream, HyperGraph::NodeArray< T > &array) |
| template<typename T > | |
| static std::ostream & | operator<< (std::ostream &outStream, HyperGraph::EdgeArray< T > &array) |
| template<typename T > | |
| static std::ostream & | operator<< (std::ostream &outStream, HyperGraph::AdjArray< T > &array) |
| ostream & | operator<< (ostream &os, ogdf::cluster c) |
| static std::ostream & | operator<< (std::ostream &outStream, HyperGraph &graph) |
| template<class E > | |
| ostream & | operator<< (ostream &os, const SListPure< E > &L) |
| template<class E > | |
| ostream & | operator<< (ostream &os, const SList< E > &L) |
| template<class E > | |
| ostream & | operator<< (ostream &os, const ListPure< E > &L) |
| template<class E > | |
| ostream & | operator<< (ostream &os, const List< E > &L) |
| bool | operator<= (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| bool | operator== (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| template<class E1 , class E2 > | |
| bool | operator== (const Tuple2< E1, E2 > &t1, const Tuple2< E1, E2 > &t2) |
| Equality operator for 2-tuples. | |
| template<class E1 , class E2 , class E3 > | |
| bool | operator== (const Tuple3< E1, E2, E3 > &t1, const Tuple3< E1, E2, E3 > &t2) |
| Equality operator for 3-tuples. | |
| template<class E1 , class E2 , class E3 , class E4 > | |
| bool | operator== (const Tuple4< E1, E2, E3, E4 > &t1, const Tuple4< E1, E2, E3, E4 > &t2) |
| Equality operator for 4-tuples. | |
| bool | operator> (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| bool | operator>= (const MDMFLengthAttribute &x, const MDMFLengthAttribute &y) |
| template<typename T > | |
| static std::istream & | operator>> (std::istream &inStream, HyperGraph::NodeArray< T > &array) |
| template<typename T > | |
| static std::istream & | operator>> (std::istream &inStream, HyperGraph::EdgeArray< T > &array) |
| template<typename T > | |
| static std::istream & | operator>> (std::istream &inStream, HyperGraph::AdjArray< T > &array) |
| static std::istream & | operator>> (std::istream &inStream, HyperGraph &graph) |
| void | parallelFreeSort (const Graph &G, SListPure< edge > &edges) |
| Sorts the edges of G such that parallel edges come after each other in the list. | |
| void | parallelFreeSortUndirected (const Graph &G, SListPure< edge > &edges, EdgeArray< int > &minIndex, EdgeArray< int > &maxIndex) |
| Sorts the edges of G such that undirected parallel edges come after each other in the list. | |
| void | petersenGraph (Graph &G, int n, int m) |
| Creates a generalized Petersen graph. | |
| void | planarBiconnectedGraph (Graph &G, int n, int m, bool multiEdges=false) |
| Creates a planar biconnected (embedded) graph. | |
| void | planarCNBGraph (Graph &G, int n, int m, int b) |
| Creates a planar graph, that is connected, but not biconnected. | |
| void | planarConnectedGraph (Graph &G, int n, int m) |
| Creates a connected (simple) planar (embedded) graph. | |
| bool | planarEmbed (Graph &G) |
| Returns true, if G is planar, false otherwise. If true is returned, G will be planarly embedded. | |
| bool | planarEmbedPlanarGraph (Graph &G) |
| Constructs a planar embedding of G. It assumes that G is planar! | |
| void | planarTriconnectedGraph (Graph &G, int n, int m) |
| Creates a planar triconnected (and simple) graph. | |
| void | planarTriconnectedGraph (Graph &G, int n, double p1, double p2) |
| Creates a planar triconnected (and simple) graph. | |
| template<class E , class INDEX > | |
| void | print (ostream &os, const BoundedQueue< E, INDEX > &S, char delim= ' ') |
| template<class E , class INDEX > | |
| void | print (ostream &os, const BoundedStack< E, INDEX > &S, char delim= ' ') |
| template<class E > | |
| void | print (ostream &os, const QueuePure< E > &Q, char delim= ' ') |
| template<class E > | |
| void | print (ostream &os, const Queue< E > &Q, char delim= ' ') |
| template<class E , class INDEX > | |
| void | print (ostream &os, const Array< E, INDEX > &a, char delim= ' ') |
| template<class E > | |
| void | print (ostream &os, const SListPure< E > &L, char delim= ' ') |
| template<class E > | |
| void | print (ostream &os, const SList< E > &L, char delim= ' ') |
| template<class E > | |
| void | print (ostream &os, const ListPure< E > &L, char delim= ' ') |
| template<class E > | |
| void | print (ostream &os, const List< E > &L, char delim= ' ') |
| template<class LIST > | |
| void | quicksortTemplate (LIST &L) |
| template<class LIST , class COMPARER > | |
| void | quicksortTemplate (LIST &L, COMPARER &comp) |
| void | randomBiconnectedGraph (Graph &G, int n, int m) |
| Creates a random biconnected graph. | |
| void | randomClusterGraph (ClusterGraph &C, Graph &G, int cNum) |
| Assigns random clusters to a given graph G. | |
| void | randomClusterGraph (ClusterGraph &C, const Graph &G, const node root, int moreInLeaves) |
| Assigns a specified cluster-structure to a given graph G, and assigns vertices to clusters. | |
| void | randomClusterPlanarGraph (ClusterGraph &C, Graph &G, int cNum) |
| Assigns random clusters to a given graph G. | |
| void | randomDiGraph (Graph &G, int n, double p) |
| Creates a random (simple) directed graph. | |
| double | randomDouble (double low, double high) |
| Returns random double value between low and high. | |
| double | randomDoubleNormal (double m, double sd) |
| void | randomGraph (Graph &G, int n, int m) |
| Creates a random graph. | |
| void | randomHierarchy (Graph &G, int n, int m, bool planar, bool singleSource, bool longEdges) |
| Creates a random hierarchical graph. | |
| int | randomNumber (int low, int high) |
| Returns random integer between low and high (including). | |
| bool | randomSimpleGraph (Graph &G, int n, int m) |
| Creates a random simple graph. | |
| void | randomTree (Graph &G, int n) |
| Creates a random tree (simpler version. | |
| void | randomTree (Graph &G, int n, int maxDeg, int maxWidth) |
| Creates a random tree. | |
| void | randomTriconnectedGraph (Graph &G, int n, double p1, double p2) |
| Creates a random triconnected (and simple) graph. | |
| template<typename ListType , typename ArrayType > | |
| static void | readFromStream (std::istream &inStream, ArrayType &array) |
| void | regularTree (Graph &G, int n, int children) |
| Creates a regular tree. | |
| int | sprintf (char *buffer, size_t, const char *format,...) |
| int | stNumber (const Graph &G, NodeArray< int > &numbering, node s=0, node t=0, bool randomized=false) |
| Computes an st-Numbering of G. | |
| int | strcat (char *strDest, size_t, const char *strSource) |
| int | strcpy (char *strDest, size_t, const char *strSource) |
| int | strncpy (char *strDest, size_t, const char *strSource, size_t count) |
| int | strongComponents (const Graph &G, NodeArray< int > &component) |
| Computes the strongly connected components of the digraph G. | |
| void | suspension (Graph &G, int s) |
| Modifies G by adding its n-th suspension. | |
| bool | test_forall_adj_edges (adjEntry &adj, edge &e) |
| bool | test_forall_adj_edges_of_cluster (ListIterator< adjEntry > &it, edge &e) |
| bool | test_forall_adj_edges_of_cluster (adjEntry &adj, edge &e) |
| bool | test_forall_adj_entries_of_cluster (ListIterator< adjEntry > &it, adjEntry &adj) |
| bool | testSTnumber (const Graph &G, NodeArray< int > &st_no, int max) |
| Tests, whether a numbering of the nodes is an st-numbering. | |
| void | topologicalNumbering (const Graph &G, NodeArray< int > &num) |
| Computes a topological numbering of an acyclic digraph G. | |
| void | triangulate (Graph &G) |
| Triangulates a planarly embedded graph G by adding edges. | |
| double | usedTime (double &T) |
| int | vsprintf (char *buffer, size_t, const char *format, va_list argptr) |
| void | wheelGraph (Graph &G, int n) |
| Creates the graph \(W_n^{(d)}\): A wheel graph. | |
| template<typename ListType , typename ArrayType > | |
| static void | writeToStream (std::ostream &outStream, ArrayType &array) |
Simple graph formats (without layout) | |
These functions load graphs stored in some common, simple text-based file formats. They just read the graph structure and not any layout specific data. | |
| bool | loadRomeGraph (Graph &G, istream &is) |
| Loads a graph G stored in the Rome-Graph-format from an input stream is. | |
| bool | loadRomeGraph (Graph &G, const char *fileName) |
| Loads a graph G stored in the Rome-Graph-format from a file fileName. | |
| bool | loadChacoGraph (Graph &G, istream &is) |
| Loads a graph G stored in the chaco file format from an input stream is. | |
| bool | loadChacoGraph (Graph &G, const char *fileName) |
| Loads a graph G stored in the chaco file format from a file fileName. | |
| bool | loadSimpleGraph (Graph &G, istream &is) |
| Loads a graph G stored in a simple format from an input stream is. | |
| bool | loadSimpleGraph (Graph &G, const char *fileName) |
| Loads a graph G stored in a simple format from a file fileName. | |
| bool | loadYGraph (Graph &G, FILE *lineStream) |
| Loads a graph G stored in the Y-graph-format from file stream (one line) lineStream. | |
Simple graph formats (with layout) | |
These functions load and save graphs in some common, simple text-based file formats, which also store layout specific data in some limited way. | |
| bool | loadChallengeGraph (Graph &G, GridLayout &gl, istream &is) |
| Loads a graph G with layout gl stored in GD-Challenge-format from stream is. | |
| bool | loadChallengeGraph (Graph &G, GridLayout &gl, const char *fileName) |
| Loads a graph G with layout gl stored in GD-Challenge-format from file fileName. | |
| bool | saveChallengeGraph (const Graph &G, const GridLayout &gl, ostream &os) |
| Writes graph G with layout gl in GD-Challenge-format to stream os. | |
| bool | saveChallengeGraph (const Graph &G, const GridLayout &gl, const char *fileName) |
| Writes graph G with layout gl in GD-Challenge-format to file fileName. | |
Simple graph formats (with subgraph) | |
These functions load and store graphs in a simple text-based file format that also specifies a subgraph (given as a list of edges). | |
| bool | loadEdgeListSubgraph (Graph &G, List< edge > &delEdges, istream &is) |
| Loads graph G with subgraph defined by delEdges from stream is. | |
| bool | loadEdgeListSubgraph (Graph &G, List< edge > &delEdges, const char *fileName) |
| Loads graph G with subgraph defined by delEdges from file fileName. | |
| bool | saveEdgeListSubgraph (const Graph &G, const List< edge > &delEdges, ostream &os) |
| Writes graph G with subgraph defined by delEdges to stream os. | |
| bool | saveEdgeListSubgraph (const Graph &G, const List< edge > &delEdges, const char *fileName) |
| Writes graph G with subgraph defined by delEdges to file fileName. | |
Hypergraphs | |
These functions load hypergraphs stored in file formats used for electrical circuits. The hypergraphs are directly transformed into their point-based expansions (and hence stored in a usual Graph and not a Hypergraph). | |
| bool | loadBenchHypergraph (Graph &G, List< node > &hypernodes, List< edge > *shell, istream &is) |
| Loads a hypergraph in the BENCH-format from input stream is. | |
| bool | loadBenchHypergraph (Graph &G, List< node > &hypernodes, List< edge > *shell, const char *fileName) |
| Loads a hypergraph in the BENCH-format from the specified file. | |
| bool | loadPlaHypergraph (Graph &G, List< node > &hypernodes, List< edge > *shell, istream &is) |
| Loads a hypergraph in the PLA-format from input stream is. | |
| bool | loadPlaHypergraph (Graph &G, List< node > &hypernodes, List< edge > *shell, const char *fileName) |
| Loads a hypergraph in the PLA-format from file fileName. | |
Variables | |
| const char * | compressionOptionNames [] |
| const char * | interleavingOptionNames [] |
| const char * | linkOptionNames [] |
| static Initialization | s_ogdfInitializer |
The namespace for all OGDF objects.
| typedef AdjElement* ogdf::adjEntry |
| typedef ClusterElement* ogdf::cluster |
The type of clusters.
Definition at line 193 of file ClusterGraph.h.
| typedef EdgeElement* ogdf::edge |
| typedef long ogdf::edgeType |
Definition at line 58 of file EdgeTypePatterns.h.
| typedef FaceElement* ogdf::face |
Definition at line 58 of file CombinatorialEmbedding.h.
| typedef HashElement<String,int>* ogdf::GmlKey |
Definition at line 62 of file GmlParser.h.
| typedef HashElement<String,int> ogdf::HashedString |
Definition at line 65 of file DinoXmlParser.h.
| typedef NodeElement* ogdf::node |
| typedef long ogdf::nodeType |
Definition at line 60 of file NodeTypePatterns.h.
| typedef PALabel* ogdf::pa_label |
| typedef PlanarLeafKey<IndInfo*>* ogdf::PtrPlanarLeafKeyI |
Definition at line 66 of file EmbedPQTree.h.
| typedef PlanarLeafKey<whaInfo*>* ogdf::PtrPlanarLeafKeyW |
Definition at line 77 of file PlanarSubgraphPQTree.h.
| typedef PQBasicKey<edge,IndInfo*,bool>* ogdf::PtrPQBasicKeyEIB |
Definition at line 60 of file EmbedPQTree.h.
| typedef PQLeafKey<edge,whaInfo*,bool>* ogdf::PtrPQLeafKeyEWB |
Definition at line 72 of file PlanarSubgraphPQTree.h.
| typedef HashElement<String,int>* ogdf::XmlKey |
Definition at line 56 of file XmlObject.h.
Code for an internal failure condition.
Definition at line 120 of file exceptions.h.
| enum ogdf::bend_type |
edge types, defined by necessary bends
| bend_free | |
| bend_1left | |
| bend_1right | |
| bend_2left | |
| bend_2right | |
| prob_bf | |
| prob_b1l | |
| prob_b1r | |
| prob_b2l | |
| prob_b2r |
Definition at line 68 of file EdgeRouter.h.
| enum ogdf::BendType |
Definition at line 66 of file OrthoRep.h.
| enum ogdf::candStatus |
Definition at line 109 of file EdgeLabel.h.
Defines options for compression search paths. PC = Path Compression, PS = Path Splitting (default), PH = Path Halving, R1 = Reversal of type 1, CO = Collapsing, NF = No Compression
Definition at line 63 of file DisjointSets.h.
| cetBasicArc | |
| cetVertexSizeArc | |
| cetVisibilityArc | |
| cetFixToZeroArc | |
| cetReducibleArc | |
| cetMedianArc |
Definition at line 65 of file CompactionConstraintGraph.h.
| enum ogdf::CPUFeature |
Special features supported by a x86/x64 CPU.
This enumeration is used to specify spcial additional features that are supported by the CPU, in particular extended instruction sets such as SSE.
| enum ogdf::CPUFeatureMask |
Bit mask for CPU features.
| enum ogdf::Direction |
| enum ogdf::eLabelType |
| elEnd1 | |
| elMult1 | |
| elName | |
| elEnd2 | |
| elMult2 | |
| elNumLabels |
the number of available labels at an edge |
Definition at line 63 of file ELabelInterface.h.
| enum ogdf::enumDirection |
Directions for clockwise and counterclockwise traversal.
Definition at line 62 of file BoyerMyrvoldPlanar.h.
| enum ogdf::enumEdgeType |
Type of edge.
| 0 | undefined |
| 1 | selfloop |
| 2 | backedge |
| 3 | DFS-edge |
| 4 | parallel DFS-edge |
| 5 | deleted backedge |
Definition at line 75 of file BoyerMyrvoldPlanar.h.
| enum ogdf::eUsedLabels |
Definition at line 72 of file ELabelInterface.h.
| enum ogdf::FileType |
| enum ogdf::GmlObjectType |
| gmlIntValue | |
| gmlDoubleValue | |
| gmlStringValue | |
| gmlListBegin | |
| gmlListEnd | |
| gmlKey | |
| gmlEOF | |
| gmlError |
Definition at line 63 of file GmlParser.h.
Definition at line 75 of file DisjointSets.h.
Code for the library which was intended to get used, but its use is not supported.
| lnscUnknown | |
| lnscCoin |
COIN not supported. |
| lnscAbacus |
ABACUS not supported. |
| lnscFunctionNotImplemented |
the used library doesn't support that function |
| lnscMissingCallbackImplementation | |
| lnscSTOP |
Definition at line 139 of file exceptions.h.
| enum ogdf::LinkOptions |
Defines options for linking two sets. NL = Naive Link, LI = Link by Index (default), LS = Link by Size, LR = Link by Rank
Definition at line 55 of file DisjointSets.h.
| enum ogdf::OptionProfile |
Definition at line 61 of file OrthoLayout.h.
| enum ogdf::Orientation |
Determines the orientation in hierarchical layouts.
Definition at line 61 of file geometry.h.
| enum ogdf::OrthoDir |
Definition at line 71 of file OrthoRep.h.
Definition at line 98 of file EdgeLabel.h.
| enum ogdf::paStopCause |
Error code for a violated precondition.
Definition at line 97 of file exceptions.h.
| enum ogdf::process_type |
Definition at line 83 of file EdgeRouter.h.
!!attention sign, 7fffffff
Definition at line 69 of file EdgeTypePatterns.h.
Definition at line 90 of file EdgeTypePatterns.h.
Definition at line 60 of file EdgeTypePatterns.h.
!!attention sign, 7fffffff
| ntPrimOriginal | |
| ntPrimCopy | |
| ntSecStructural | |
| ntSecNonStructural | |
| ntTerCrossing | |
| ntTerExpander | |
| ntTerHDExpander | |
| ntTerLDExpander | |
| ntFourFlow | |
| ntFourLabel | |
| ntFourType | |
| ntFourCorner |
Definition at line 71 of file NodeTypePatterns.h.
Definition at line 90 of file NodeTypePatterns.h.
Definition at line 62 of file NodeTypePatterns.h.
| enum ogdf::UMLOpt |
Definition at line 62 of file LayoutPlanRepModule.h.
| enum ogdf::whaType |
The definitions for W_TYPE, B_TYPE, H_TYPE and A_TYPE describe the type of a node during the computation of the maximal pertinent sequence. A pertinent node X in the PQ-tree will be either of type B, W, A or H. Together with some other information stored at every node the pertinent leaves in the frontier of X that have to be deleted. For further description of the types see Jayakumar, Thulasiraman and Swamy 1989.
| enum ogdf::XmlObjectType |
| xmlIntValue | |
| xmlDoubleValue | |
| xmlStringValue | |
| xmlListBegin | |
| xmlListEnd | |
| xmlKey | |
| xmlEOF | |
| xmlError |
Definition at line 57 of file XmlObject.h.
| enum ogdf::XmlToken |
This enum type represents the values, which are returned by the function DinoXmlScanner::getNextToken().
Definition at line 62 of file DinoXmlScanner.h.
| int ogdf::biconnectedComponents | ( | const Graph & | G, |
| EdgeArray< int > & | component | ||
| ) |
Computes the biconnected components of G.
Assigns component numbers (0, 1, ...) to the edges of \ G. The component number of each edge is stored in the edge array component.
| G | is the input graph. |
| component | is assigned a mapping from edges to component numbers. |
| void ogdf::bucketSort | ( | Array< E > & | a, |
| int | min, | ||
| int | max, | ||
| BucketFunc< E > & | f | ||
| ) |
| bool ogdf::changeDir | ( | const char * | dirName | ) |
Changes current directory to dirName; returns true if successful.
| void ogdf::completeBipartiteGraph | ( | Graph & | G, |
| int | n, | ||
| int | m | ||
| ) |
Creates t complete bipartite graph \(K_{n,m}\).
| G | is assigned the generated graph. |
| n | is the number of nodes of the first partition set. |
| m | is the number of nodes of the second partition set. |
| void ogdf::completeGraph | ( | Graph & | G, |
| int | n | ||
| ) |
Creates the complete graph \(K_n\).
| G | is assigned the generated graph. |
| n | is the number of nodes of the generated graph. |
| T ogdf::computeMinST | ( | const Graph & | G, |
| const EdgeArray< T > & | weight, | ||
| EdgeArray< bool > & | isInTree | ||
| ) |
Computes a minimum spanning tree using Prim's algorithm.
| T | is the numeric type for edge weights. |
| G | is the input graph. |
| weight | is an edge array with the edge weights. |
| isInTree | is assigned the result, i.e. isInTree[e] is true iff edge e is in the computed MST. |
Definition at line 274 of file extended_graph_alg.h.
| T ogdf::computeMinST | ( | const Graph & | G, |
| const EdgeArray< T > & | weight, | ||
| NodeArray< edge > & | pred, | ||
| EdgeArray< bool > & | isInTree | ||
| ) |
Computes a minimum spanning tree (MST) using Prim's algorithm.
| T | is the numeric type for edge weights. |
| G | is the input graph. |
| weight | is an edge array with the edge weights. |
| isInTree | is assigned the result, i.e. isInTree[e] is true iff edge e is in the computed MST. |
| pred | is assigned for each node the edge from its parent in the MST. |
Definition at line 290 of file extended_graph_alg.h.
| T ogdf::computeMinST | ( | node | s, |
| const Graph & | G, | ||
| const EdgeArray< T > & | weight, | ||
| NodeArray< edge > & | pred, | ||
| EdgeArray< bool > & | isInTree | ||
| ) |
Computes a minimum spanning tree (MST) using Prim's algorithm.
| T | is the numeric type for edge weights. |
| s | is the start node for Prim's algorithm and will be the root of the MST. |
| G | is the input graph. |
| weight | is an edge array with the edge weights. |
| isInTree | is assigned the result, i.e. isInTree[e] is true iff edge e is in the computed MST. |
| pred | is assigned for each node the edge from its parent in the MST. |
Definition at line 306 of file extended_graph_alg.h.
| int ogdf::connectedComponents | ( | const Graph & | G, |
| NodeArray< int > & | component | ||
| ) |
Computes the connected components of G.
Assigns component numbers (0, 1, ...) to the nodes of G. The component number of each node is stored in the node array component.
| G | is the input graph. |
| component | is assigned a mapping from nodes to component numbers. |
| int ogdf::connectedIsolatedComponents | ( | const Graph & | G, |
| List< node > & | isolated, | ||
| NodeArray< int > & | component | ||
| ) |
Computes the connected components of G and returns the list of isolated nodes.
Assigns component numbers (0, 1, ...) to the nodes of G. The component number of each node is stored in the node array component.
| G | is the input graph. |
| isolated | is assigned the list of isolated nodes. An isolated node is a node without incident edges. |
| component | is assigned a mapping from nodes to component numbers. |
| void ogdf::cubeGraph | ( | Graph & | G, |
| int | n | ||
| ) |
Creates the graph \(Q^n\): A n-cube graph.
| G | is assigned the generated graph. |
| n | is the number of the cube's dimensions (n>=0). |
| bool ogdf::dfsGenTree | ( | UMLGraph & | UG, |
| List< edge > & | fakedGens, | ||
| bool | fakeTree | ||
| ) |
Definition at line 121 of file precondition.h.
| bool ogdf::dfsGenTreeRec | ( | UMLGraph & | UG, |
| EdgeArray< bool > & | used, | ||
| NodeArray< int > & | hierNumber, | ||
| int | hierNum, | ||
| node | v, | ||
| List< edge > & | fakedGens, | ||
| bool | fakeTree | ||
| ) |
Definition at line 60 of file precondition.h.
|
inline |
Definition at line 71 of file geometry.h.
|
inline |
Definition at line 83 of file geometry.h.
|
inline |
Definition at line 77 of file geometry.h.
|
inline |
Definition at line 95 of file geometry.h.
|
inline |
Definition at line 89 of file geometry.h.
|
inline |
doDestruction() returns false if a data type does not require to call its destructor (e.g. build-in data types).
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Definition at line 69 of file EmbedPQTree.h.
|
inline |
Definition at line 80 of file PlanarSubgraphPQTree.h.
|
inline |
Definition at line 63 of file EmbedPQTree.h.
|
inline |
Definition at line 75 of file PlanarSubgraphPQTree.h.
|
inline |
Definition at line 101 of file geometry.h.
| edge ogdf::firstOutGen | ( | UMLGraph & | UG, |
| node | v, | ||
| EdgeArray< bool > & | |||
| ) |
Definition at line 104 of file precondition.h.
| void ogdf::getEntries | ( | const char * | dirName, |
| List< String > & | entries, | ||
| const char * | pattern = "*" |
||
| ) |
Returns in entries the list of all entries contained in directory dirName.
Entries may be files or directories. The optional argument pattern can be used to filter files.
| void ogdf::getEntries | ( | const char * | dirName, |
| FileType | t, | ||
| List< String > & | entries, | ||
| const char * | pattern = "*" |
||
| ) |
Returns in entries the list of all entries of type t contained in directory dirName.
The optional argument pattern can be used to filter files.
| void ogdf::getEntriesAppend | ( | const char * | dirName, |
| List< String > & | entries, | ||
| const char * | pattern = "*" |
||
| ) |
Appends to entries the list of all entries contained in directory dirName.
Entries may be files or directories. The optional argument pattern can be used to filter files.
| void ogdf::getEntriesAppend | ( | const char * | dirName, |
| FileType | t, | ||
| List< String > & | entries, | ||
| const char * | pattern = "*" |
||
| ) |
Appends to entries the list of all entries of type t contained in directory dirName.
The optional argument pattern can be used to filter files.
| void ogdf::getFiles | ( | const char * | dirName, |
| List< String > & | files, | ||
| const char * | pattern = "*" |
||
| ) |
Returns in files the list of files in directory dirName.
The optional argument pattern can be used to filter files.
| void ogdf::getFilesAppend | ( | const char * | dirName, |
| List< String > & | files, | ||
| const char * | pattern = "*" |
||
| ) |
Appends to files the list of files in directory dirName.
The optional argument pattern can be used to filter files.
| void ogdf::getParallelFreeUndirected | ( | const Graph & | G, |
| EdgeArray< EDGELIST > & | parallelEdges | ||
| ) |
Computes the bundles of undirected parallel edges in G.
Stores for one (arbitrarily chosen) reference edge all edges belonging to the same bundle of undirected parallel edges; no edge is removed from the graph.
| EDGELIST | is the type of edge list that is assigned the list of edges. |
| G | is the input graph. |
| parallelEdges | is assigned for each reference edge the list of edges belonging to the bundle of undirected parallel edges. |
Definition at line 346 of file simple_graph_alg.h.
| void ogdf::getSubdirs | ( | const char * | dirName, |
| List< String > & | subdirs, | ||
| const char * | pattern = "*" |
||
| ) |
Returns in subdirs the list of directories contained in directory dirName.
The optional argument pattern can be used to filter files.
| void ogdf::getSubdirsAppend | ( | const char * | dirName, |
| List< String > & | subdirs, | ||
| const char * | pattern = "*" |
||
| ) |
Appends to subdirs the list of directories contained in directory dirName.
The optional argument pattern can be used to filter files.
| void ogdf::gridGraph | ( | Graph & | G, |
| int | n, | ||
| int | m, | ||
| bool | loopN, | ||
| bool | loopM | ||
| ) |
Creates a (toroidal) grid graph on n x m nodes.
| G | is assigned the generated graph. |
| n | is the number of nodes on first axis. |
| m | is the number of nodes on second axis. |
| loopN | if the grid is cyclic on first axis |
| loopM | if the grid is cyclic on second axis |
| bool ogdf::hasSingleSink | ( | const Graph & | G, |
| node & | sink | ||
| ) |
Returns true iff the digraph G contains exactly one sink node (or is empty).
| G | is the input graph. |
| sink | is assigned the single sink if true is returned, or 0 otherwise. |
|
inline |
Returns true iff the digraph G contains exactly one sink node (or is empty).
| G | is the input graph. |
Definition at line 689 of file simple_graph_alg.h.
| bool ogdf::hasSingleSource | ( | const Graph & | G, |
| node & | source | ||
| ) |
Returns true iff the digraph G contains exactly one source node (or is empty).
| G | is the input graph. |
| source | is assigned the single source if true is returned, or 0 otherwise. |
|
inline |
Returns true iff the digraph G contains exactly one source node (or is empty).
| G | is the input graph. |
Definition at line 669 of file simple_graph_alg.h.
| void ogdf::inducedSubGraph | ( | const Graph & | G, |
| LISTITERATOR | start, | ||
| Graph & | subGraph | ||
| ) |
Computes the subgraph induced by a list of nodes.
| NODELISTITERATOR | is the type of iterators for the input list of nodes. |
| G | is the input graph. |
| start | is a list iterator pointing to the first element in a list of nodes, for which an induced subgraph shall be computed. |
| subGraph | is assigned the computed subgraph. |
Definition at line 72 of file extended_graph_alg.h.
| void ogdf::inducedSubGraph | ( | const Graph & | G, |
| LISTITERATOR | start, | ||
| Graph & | subGraph, | ||
| NodeArray< node > & | nodeTableOrig2New | ||
| ) |
Computes the subgraph induced by a list of nodes (plus a mapping from original nodes to new copies).
| NODELISTITERATOR | is the type of iterators for the input list of nodes. |
| G | is the input graph. |
| start | is a list iterator pointing to the first element in a list of nodes, for which an induced subgraph shall be computed. |
| subGraph | is assigned the computed subgraph. |
| nodeTableOrig2New | is assigned a mapping from the nodes in G to the nodes in subGraph. |
Definition at line 88 of file extended_graph_alg.h.
| void ogdf::inducedSubGraph | ( | const Graph & | G, |
| LISTITERATOR | start, | ||
| Graph & | subGraph, | ||
| NodeArray< node > & | nodeTableOrig2New, | ||
| EdgeArray< edge > & | edgeTableOrig2New | ||
| ) |
Computes the subgraph induced by a list of nodes (plus mappings from original nodes and edges to new copies).
| NODELISTITERATOR | is the type of iterators for the input list of nodes. |
| G | is the input graph. |
| start | is a list iterator pointing to the first element in a list of nodes, for which an induced subgraph shall be computed. |
| subGraph | is assigned the computed subgraph. |
| nodeTableOrig2New | is assigned a mapping from the nodes in G to the nodes in subGraph. |
| edgeTableOrig2New | is assigned a mapping from the edges in G to the egdes in subGraph. |
Definition at line 131 of file extended_graph_alg.h.
| void ogdf::inducedSubgraph | ( | Graph & | G, |
| NODELISTITERATOR & | it, | ||
| EDGELIST & | E | ||
| ) |
Computes the edges in a node-induced subgraph.
| NODELISTITERATOR | is the type of iterators for the input list of nodes. |
| EDGELIST | is the type of the returned edge list. |
| G | is the input graph. |
| it | is a list iterator pointing to the first element in a list of nodes, whose induced subgraph is considered. |
| E | is assigned the list of edges in the node-induced subgraph. |
Definition at line 180 of file extended_graph_alg.h.
| bool ogdf::isAcyclic | ( | const Graph & | G, |
| List< edge > & | backedges | ||
| ) |
Returns true iff the digraph G is acyclic.
| G | is the input graph |
| backedges | is assigned the backedges of a DFS-tree. |
|
inline |
Returns true iff the digraph G is acyclic.
| G | is the input graph |
Definition at line 610 of file simple_graph_alg.h.
| bool ogdf::isAcyclicUndirected | ( | const Graph & | G, |
| List< edge > & | backedges | ||
| ) |
Returns true iff the undirected graph G is acyclic.
| G | is the input graph |
| backedges | is assigned the backedges of a DFS-tree. |
|
inline |
Returns true iff the undirected graph G is acyclic.
| G | is the input graph |
Definition at line 630 of file simple_graph_alg.h.
| bool ogdf::isBiconnected | ( | const Graph & | G, |
| node & | cutVertex | ||
| ) |
Returns true iff G is biconnected.
| G | is the input graph. |
| cutVertex | If false is returned, cutVertex is assigned either 0 if G is not connected, or a cut vertex in G. |
|
inline |
Returns true iff G is biconnected.
| G | is the input graph. |
Definition at line 486 of file simple_graph_alg.h.
| bool ogdf::isCConnected | ( | const ClusterGraph & | C | ) |
Returns true iff cluster graph C is c-connected.
| bool ogdf::isConnected | ( | const Graph & | G | ) |
Returns true iff G is connected.
| G | is the input graph. |
| bool ogdf::isDirectory | ( | const char * | fileName | ) |
Returns true iff fileName is a directory.
| bool ogdf::isFile | ( | const char * | fileName | ) |
Returns true iff fileName is a regular file (not a directory).
| bool ogdf::isForest | ( | const Graph & | G, |
| List< node > & | roots | ||
| ) |
Returns true iff G represents a forest, i.e., a collection of rooted trees.
| G | is the input graph. |
| roots | is assigned the list of root nodes of the trees in the forest. |
|
inline |
Returns true iff G represents a forest, i.e. a collection of rooted trees.
| G | is the input graph. |
Definition at line 771 of file simple_graph_alg.h.
| bool ogdf::isFreeForest | ( | const Graph & | G | ) |
Returns true iff G is a free forest, i.e. contains no undirected cycle.
| G | is the input graph. |
| bool ogdf::isLoopFree | ( | const Graph & | G | ) |
Returns true iff G contains no self-loop.
| G | is the input graph. |
| bool ogdf::isParallelFree | ( | const Graph & | G | ) |
Returns true iff G contains no paralle edges.
A parallel edge is an edge e1=(v,w) such that there exists another edge e2=(v,w) in the graph. Reversal edges (e.g. (v,w) and (w,v)) are not parallel edges. If you want to test if a graph contains no undirected parallel edges, use isParallelFreeUndirected().
| G | is the input graph. |
| bool ogdf::isParallelFreeUndirected | ( | const Graph & | G | ) |
Returns true iff G contains no undirected parallel edges.
An undirected parallel edges is an edge e1=(v,w) such that there exists another edge e2=(v,w) or (w,v) in the graph.
| G | is the input graph. |
|
inline |
Returns true, if G is planar, false otherwise.
This is a shortcut for BoyerMyrvold::isPlanar().
| G | is the input graph. |
Definition at line 385 of file extended_graph_alg.h.
|
inline |
Returns true iff G contains neither self-loops nor parallel edges.
| G | is the input graph. |
Definition at line 377 of file simple_graph_alg.h.
|
inline |
Returns true iff G contains neither self-loops nor undirected parallel edges.
| G | is the input graph. |
Definition at line 398 of file simple_graph_alg.h.
| bool ogdf::isStGraph | ( | const Graph & | G, |
| node & | s, | ||
| node & | t, | ||
| edge & | st | ||
| ) |
Returns true iff G is an st-digraph.
A directed graph is an st-digraph if it is acyclic, contains exactly one source s and one sink t, and the edge (s,t).
| G | is the input graph. |
| s | is assigned the single source (if true is returned). |
| t | is assigned the single sink (if true is returned). |
| st | is assigned the edge (s,t) (if true is returned). |
|
inline |
Returns true if G is an st-digraph.
A directed graph is an st-digraph if it is acyclic, contains exactly one source s and one sink t, and the edge (s,t).
| G | is the input graph. |
Definition at line 716 of file simple_graph_alg.h.
| bool ogdf::isTree | ( | const Graph & | G, |
| node & | root | ||
| ) |
Returns true iff G represents a tree.
| G | is the input graph. |
| root | is assigned the root node (if true is returned). |
|
inline |
Returns true iff G represents a tree.
| G | is the input graph. |
Definition at line 792 of file simple_graph_alg.h.
| bool ogdf::isTriconnected | ( | const Graph & | G, |
| node & | s1, | ||
| node & | s2 | ||
| ) |
Returns true iff G is triconnected.
If true is returned, then either
| G | is the input graph. |
| s1 | is assigned a cut vertex of one node of a separation pair, if G is not triconnected (see above). |
| s2 | is assigned one node of a separation pair, if G is not triconnected (see above). |
|
inline |
Returns true iff G is triconnected.
| G | is the input graph. |
Definition at line 542 of file simple_graph_alg.h.
| bool ogdf::isTriconnectedPrimitive | ( | const Graph & | G, |
| node & | s1, | ||
| node & | s2 | ||
| ) |
Returns true iff G is triconnected (using a quadratic time algorithm!).
If true is returned, then either
| G | is the input graph. |
| s1 | is assigned a cut vertex of one node of a separation pair, if G is not triconnected (see above). |
| s2 | is assigned one node of a separation pair, if G is not triconnected (see above). |
|
inline |
Returns true iff G is triconnected (using a quadratic time algorithm!).
| G | is the input graph. |
Definition at line 574 of file simple_graph_alg.h.
| bool ogdf::loadBenchHypergraph | ( | Graph & | G, |
| List< node > & | hypernodes, | ||
| List< edge > * | shell, | ||
| istream & | is | ||
| ) |
Loads a hypergraph in the BENCH-format from input stream is.
A hypergraph in OGDF is represented by its point-based expansion, i.e., for each hyperedge h we have a corresponding hypernode n. All nodes originally incident to h are incident to n, i.e., have regular edges to n.
| G | is assigned the graph (point-based expansion of the hypergraph). |
| hypernodes | is assigned the list of nodes which have to be interpreted as hypernodes. |
| shell | if 0 only the BENCH-hypergraph is loaded. Otherwise we extend the loaded graph by a simple edge e=(i,o) and two hyperedges: one hyperedges groups all input nodes and i together, the other hyperedge groups all output edges and o. These additional edges are then also collocated in shell. |
| is | is the input stream from which the hypergraph is read. |
| bool ogdf::loadBenchHypergraph | ( | Graph & | G, |
| List< node > & | hypernodes, | ||
| List< edge > * | shell, | ||
| const char * | fileName | ||
| ) |
Loads a hypergraph in the BENCH-format from the specified file.
| G | is assigned the graph (point-based expansion of the hypergraph). |
| hypernodes | is assigned the list of nodes which have to be interpreted as hypernodes. |
| shell | if 0 only the BENCH-hypergraph is loaded. Otherwise we extend the loaded graph by a simple edge e=(i,o) and two hyperedges: one hyperedges groups all input nodes and i together, the other hyperedge groups all output edges and o. These additional edges are then also collocated in shell. |
| fileName | is the name of the file from which the hypergraph is read. |
| bool ogdf::loadChacoGraph | ( | Graph & | G, |
| istream & | is | ||
| ) |
Loads a graph G stored in the chaco file format from an input stream is.
Graphs stored in the chaco file format are typically used in graph partitioning and use the file extension .graph.
The first line contains two integers separated by spacing: #nodes #edges A third entry indicates node and edge weights (not supported here yet). Each of the following #nodes lines from 1 to #nodes contains the space separated index list of the adjacent nodes for the node associated with that line (where node indices are from 1 to n). Macro SIMPLE_LOAD_BUFFER_SIZE defines the length of the line read buffer and should be adjusted according to the maximum read size.
| G | is assigned the loaded graph. |
| is | is the input stream from which the graph is read. |
| bool ogdf::loadChacoGraph | ( | Graph & | G, |
| const char * | fileName | ||
| ) |
Loads a graph G stored in the chaco file format from a file fileName.
| G | is assigned the loaded graph. |
| fileName | is the name of the file from which the graph is read. |
| bool ogdf::loadChallengeGraph | ( | Graph & | G, |
| GridLayout & | gl, | ||
| istream & | is | ||
| ) |
Loads a graph G with layout gl stored in GD-Challenge-format from stream is.
| G | is assigned the loaded graph. |
| gl | is assigned the grid layout. |
| is | is the input stream from which the graph is read. |
| bool ogdf::loadChallengeGraph | ( | Graph & | G, |
| GridLayout & | gl, | ||
| const char * | fileName | ||
| ) |
Loads a graph G with layout gl stored in GD-Challenge-format from file fileName.
| G | is assigned the loaded graph. |
| gl | is assigned the grid layout. |
| fileName | is the name of the file from which the graph is read. |
| bool ogdf::loadEdgeListSubgraph | ( | Graph & | G, |
| List< edge > & | delEdges, | ||
| istream & | is | ||
| ) |
Loads graph G with subgraph defined by delEdges from stream is.
| G | is assigned the loaded graph. |
| delEdges | is assigned the edges of the subgraph. |
| is | is the input stream from which the graph is read. |
| bool ogdf::loadEdgeListSubgraph | ( | Graph & | G, |
| List< edge > & | delEdges, | ||
| const char * | fileName | ||
| ) |
Loads graph G with subgraph defined by delEdges from file fileName.
| G | is assigned the loaded graph. |
| delEdges | is assigned the edges of the subgraph. |
| fileName | is the name of the file from which the graph is read. |
| bool ogdf::loadPlaHypergraph | ( | Graph & | G, |
| List< node > & | hypernodes, | ||
| List< edge > * | shell, | ||
| istream & | is | ||
| ) |
Loads a hypergraph in the PLA-format from input stream is.
A hypergraph in OGDF is represented by its point-based expansion, i.e., for each hyperedge h we have a corresponding hypernode n. All nodes originally incident to h are incident to n, i.e., have regular edges to n.
| G | is assigned the graph (point-based expansion of the hypergraph). |
| hypernodes | is assigned the list of nodes which have to be interpreted as hypernodes. |
| shell | if 0 only the PLA-hypergraph is loaded. Otherwise we extend the loaded graph by a simple edge e=(i,o) and two hyperedges: one hyperedges groups all input nodes and i together, the other hyperedge groups all output edges and o. These additional edges are then also collocated in shell. |
| is | is the input stream from which the hypergraph is read. |
| bool ogdf::loadPlaHypergraph | ( | Graph & | G, |
| List< node > & | hypernodes, | ||
| List< edge > * | shell, | ||
| const char * | fileName | ||
| ) |
Loads a hypergraph in the PLA-format from file fileName.
| G | is assigned the graph (point-based expansion of the hypergraph). |
| hypernodes | is assigned the list of nodes which have to be interpreted as hypernodes. |
| shell | if 0 only the PLA-hypergraph is loaded. Otherwise we extend the loaded graph by a simple edge e=(i,o) and two hyperedges: one hyperedges groups all input nodes and i together, the other hyperedge groups all output edges and o. These additional edges are then also collocated in shell. |
| fileName | is the name of the file from which the hypergraph is read. |
| bool ogdf::loadRomeGraph | ( | Graph & | G, |
| istream & | is | ||
| ) |
Loads a graph G stored in the Rome-Graph-format from an input stream is.
The Rome format contains (in this order) n "node-lines", 1 "separator-line", m "edge-lines". These lines are as follows (whereby all IDs are integer numbers):
0#-sign0 SourceNodeId TargetNodeId| G | is assigned the loaded graph. |
| is | is the input stream from which the graph is read. |
| bool ogdf::loadRomeGraph | ( | Graph & | G, |
| const char * | fileName | ||
| ) |
Loads a graph G stored in the Rome-Graph-format from a file fileName.
| G | is assigned the loaded graph. |
| fileName | is the name of the file from which the graph is read. |
| bool ogdf::loadSimpleGraph | ( | Graph & | G, |
| istream & | is | ||
| ) |
Loads a graph G stored in a simple format from an input stream is.
Simple format has a leading line stating the name of the graph and a following line stating the size of the graph.
*BEGIN unknown_name.numN.numE *GRAPH numN numE UNDIRECTED UNWEIGHTED
| G | is assigned the loaded graph. |
| is | is the input stream from which the graph is read. |
| bool ogdf::loadSimpleGraph | ( | Graph & | G, |
| const char * | fileName | ||
| ) |
Loads a graph G stored in a simple format from a file fileName.
This format is used e.g. for the graphs from Petra Mutzel's Ph.D. Thesis.
| G | is assigned the loaded graph. |
| fileName | is the name of the file from which the graph is read. |
| bool ogdf::loadYGraph | ( | Graph & | G, |
| FILE * | lineStream | ||
| ) |
Loads a graph G stored in the Y-graph-format from file stream (one line) lineStream.
This format is e.g. produced by NAUTY (http://www.cs.sunysb.edu/~algorith/implement/nauty/implement.shtml)
Details on the format, as given in NAUTYs graph generator (see above link): "[A] graph occupies one line with a terminating newline. Except for the newline, each byte has the format 01xxxxxx, where each "x" represents one bit of data.
First byte: xxxxxx is the number of vertices n
Other ceiling(n(n-1)/12) bytes: These contain the upper triangle of the adjacency matrix in column major order. That is, the entries appear in the order (0,1),(0,2),(1,2),(0,3),(1,3),(2,3),(0,4),... . The bits are used in left to right order within each byte. Any unused bits on the end are set to zero.
|
inline |
| void ogdf::makeAcyclic | ( | Graph & | G | ) |
Makes the digraph G acyclic by removing edges.
The implementation removes all backedges of a DFS tree.
| G | is the input graph |
| void ogdf::makeAcyclicByReverse | ( | Graph & | G | ) |
Makes the digraph G acyclic by reversing edges.
| G | is the input graph |
| void ogdf::makeBiconnected | ( | Graph & | G, |
| List< edge > & | added | ||
| ) |
Makes G biconnected by adding edges.
| G | is the input graph. |
| added | is assigned the list of inserted edges. |
|
inline |
Makes G biconnected by adding edges.
| G | is the input graph. |
Definition at line 504 of file simple_graph_alg.h.
| void ogdf::makeCConnected | ( | ClusterGraph & | C, |
| Graph & | G, | ||
| List< edge > & | addedEdges, | ||
| bool | simple = true |
||
| ) |
Makes a cluster graph c-connected by adding edges.
| C | is the input cluster graph. |
| G | is the graph associated with the cluster graph C; the function adds new edges to this graph. |
| addedEdges | is assigned the list of newly created edges. |
| simple | selects the method used: If set to true, a simple variant that does not guarantee to preserve planarity is used. |
| void ogdf::makeConnected | ( | Graph & | G, |
| List< edge > & | added | ||
| ) |
Makes G connected by adding a minimum number of edges.
| G | is the input graph. |
| added | is assigned the added edges. |
|
inline |
makes G connected by adding a minimum number of edges.
| G | is the input graph. |
Definition at line 438 of file simple_graph_alg.h.
| void ogdf::makeLoopFree | ( | Graph & | G, |
| NODELIST & | L | ||
| ) |
Removes all self-loops from G and returns all nodes with self-loops in L.
| NODELIST | is the type of the node list for returning the nodes with self-loops. |
| G | is the input graph. |
| L | is assigned the list of nodes with self-loops. |
Definition at line 77 of file simple_graph_alg.h.
| void ogdf::makeLoopFree | ( | Graph & | G | ) |
Removes all self-loops from G.
| G | is the input graph. |
| void ogdf::makeParallelFree | ( | Graph & | G, |
| EDGELIST & | parallelEdges | ||
| ) |
Removes all but one of each bundle of parallel edges.
A parallel edge is an edge e1=(v,w) such that there exists another edge e2=(v,w) in the graph. Reversal edges (e.g. (v,w) and (w,v)) are not multi-edges. If you want to remove parallel and reversal edges, use makeParallelFreeUndirected(Graph&,EDGELIST&).
| EDGELIST | is the type of edge list that will be assigned the list of parallel edges. |
| G | is the input graph. |
| parallelEdges | is assigned the list of remaining edges in G that were part of a bundle of parallel edges in the input graph. |
Definition at line 148 of file simple_graph_alg.h.
|
inline |
Removes all but one edge of each bundle of parallel edges in G.
A parallel edge is an edge e1=(v,w) such that there exists another edge e2=(v,w) in the graph. Reversal edges (e.g. (v,w) and (w,v)) are not parallel edges. If you want to remove parallel and reversal edges, use makeParallelFreeUndirected(Graph&).
| G | is the input graph. |
Definition at line 179 of file simple_graph_alg.h.
| void ogdf::makeParallelFreeUndirected | ( | Graph & | G, |
| EDGELIST & | parallelEdges | ||
| ) |
Removes all but one of each bundle of undirected parallel edges.
An undirected parallel edges is an edge e1=(v,w) such that there exists another edge e2=(v,w) or (w,v) in the graph. The function removes unordered pair {v,w} of nodes all but one of the edges with endpoints v and w (in any order).
| EDGELIST | is the type of edge list that will be assigned the list of edges. |
| G | is the input graph. |
| parallelEdges | is assigned the list of remaining edges that were part of a bundle of undirected parallel edges in the input graph. |
Definition at line 238 of file simple_graph_alg.h.
|
inline |
Removes all but one of each bundle of undirected parallel edges.
An undirected parallel edges is an edge e1=(v,w) such that there exists another edge e2=(v,w) or (w,v) in the graph. The function removes unordered pair {v,w} of nodes all but one of the edges with endpoints v and w (in any order).
| G | is the input graph. |
Definition at line 270 of file simple_graph_alg.h.
| void ogdf::makeParallelFreeUndirected | ( | Graph & | G, |
| EDGELIST & | parallelEdges, | ||
| EdgeArray< int > & | cardPositive, | ||
| EdgeArray< int > & | cardNegative | ||
| ) |
Removes all but one of each bundle of undirected parallel edges.
An undirected parallel edges is an edge e1=(v,w) such that there exists another edge e2=(v,w) or (w,v) in the graph. The function removes unordered pair {v,w} of nodes all but one of the edges with endpoints v and w (in any order).
| EDGELIST | is the type of edge list that is assigned the list of edges. |
| G | is the input graph. |
| parallelEdges | is assigned the list of remaining edges that were part of a bundle of undirected parallel edges in the input graph. |
| cardPositive | contains for each edge the number of removed undirected parallel edges pointing in the same direction. |
| cardNegative | contains for each edge the number of removed undirected parallel edges pointing in the opposite direction. |
Definition at line 292 of file simple_graph_alg.h.
|
inline |
Removes all self-loops and all but one edge of each bundle of parallel edges.
| G | is the input graph. |
Definition at line 386 of file simple_graph_alg.h.
|
inline |
Removes all self-loops and all but one edge of each bundle of undirected parallel edges.
| G | is the input graph. |
Definition at line 407 of file simple_graph_alg.h.
| int ogdf::numParallelEdges | ( | const Graph & | G | ) |
Returns the number of parallel edges in G.
A parallel edge is an edge e1=(v,w) such that there exists another edge e2=(v,w) in the graph. Reversal edges (e.g. (v,w) and (w,v)) are not parallel edges. If you want to also take reversal edges into account, use numParallelEdgesUndirected().
| G | is the input graph. |
| int ogdf::numParallelEdgesUndirected | ( | const Graph & | G | ) |
Returns the number of undirected parallel edges in G.
An undirected parallel edges is an edge e1=(v,w) such that there exists another edge e2=(v,w) or (w,v) in the graph.
| G | is the input graph. |
| bool ogdf::operator!= | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| bool ogdf::operator!= | ( | const Tuple2< E1, E2 > & | t1, |
| const Tuple2< E1, E2 > & | t2 | ||
| ) |
| bool ogdf::operator!= | ( | const Tuple3< E1, E2, E3 > & | t1, |
| const Tuple3< E1, E2, E3 > & | t2 | ||
| ) |
| bool ogdf::operator!= | ( | const Tuple4< E1, E2, E3, E4 > & | t1, |
| const Tuple4< E1, E2, E3, E4 > & | t2 | ||
| ) |
| MDMFLengthAttribute ogdf::operator+ | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| MDMFLengthAttribute ogdf::operator+= | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| MDMFLengthAttribute ogdf::operator- | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| MDMFLengthAttribute ogdf::operator-= | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| bool ogdf::operator< | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| ogdf::node | v | ||
| ) |
Output operator for nodes; prints node index (or "nil").
| ostream& ogdf::operator<< | ( | ostream & | os, |
| ogdf::edge | e | ||
| ) |
Output operator for edges; prints source and target indices (or "nil").
| std::ostream& ogdf::operator<< | ( | std::ostream & | os, |
| const nodePair & | v | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| ogdf::adjEntry | adj | ||
| ) |
Output operator for adjacency entries; prints node and twin indices (or "nil").
| ostream& ogdf::operator<< | ( | ostream & | s, |
| const MDMFLengthAttribute & | x | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const Tuple2< E1, E2 > & | t2 | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DinoUmlModelGraph & | modelGraph | ||
| ) |
Output operator for DinoUmlModelGraph.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const RCCrossings & | cr | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const Tuple3< E1, E2, E3 > & | t3 | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const IPoint & | ip | ||
| ) |
Output operator for integer points.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DinoUmlDiagramGraph & | diagramGraph | ||
| ) |
Output operator for DinoUmlDiagramGraph.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const BoundedQueue< E, INDEX > & | Q | ||
| ) |
Definition at line 194 of file BoundedQueue.h.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const BoundedStack< E, INDEX > & | S | ||
| ) |
Definition at line 200 of file BoundedStack.h.
|
inline |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const QueuePure< E > & | Q | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const Queue< E > & | Q | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const StackPure< E > & | S | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const Stack< E > & | S | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const Tuple4< E1, E2, E3, E4 > & | t4 | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DPoint & | dp | ||
| ) |
Output operator for real points.
| ostream& ogdf::operator<< | ( | ostream & | O, |
| const NodeInfo & | inf | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DinoXmlParser & | parser | ||
| ) |
Output operator for DinoXmlParser.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DLine & | dl | ||
| ) |
Output operator for lines.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const ogdf::Array< E, INDEX > & | a | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DRect & | dr | ||
| ) |
Output operator for rectangles.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DScaler & | ds | ||
| ) |
Output operator for scalers.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const DPolygon & | dop | ||
| ) |
Output operator for polygons.
|
static |
Definition at line 800 of file HyperGraph.h.
|
static |
Definition at line 807 of file HyperGraph.h.
|
static |
Definition at line 814 of file HyperGraph.h.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| ogdf::cluster | c | ||
| ) |
|
static |
Definition at line 859 of file HyperGraph.h.
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const SListPure< E > & | L | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const SList< E > & | L | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const ListPure< E > & | L | ||
| ) |
| ostream& ogdf::operator<< | ( | ostream & | os, |
| const List< E > & | L | ||
| ) |
| bool ogdf::operator<= | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| bool ogdf::operator== | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| bool ogdf::operator== | ( | const Tuple2< E1, E2 > & | t1, |
| const Tuple2< E1, E2 > & | t2 | ||
| ) |
| bool ogdf::operator== | ( | const Tuple3< E1, E2, E3 > & | t1, |
| const Tuple3< E1, E2, E3 > & | t2 | ||
| ) |
| bool ogdf::operator== | ( | const Tuple4< E1, E2, E3, E4 > & | t1, |
| const Tuple4< E1, E2, E3, E4 > & | t2 | ||
| ) |
| bool ogdf::operator> | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
| bool ogdf::operator>= | ( | const MDMFLengthAttribute & | x, |
| const MDMFLengthAttribute & | y | ||
| ) |
|
static |
Definition at line 829 of file HyperGraph.h.
|
static |
Definition at line 837 of file HyperGraph.h.
|
static |
Definition at line 845 of file HyperGraph.h.
|
static |
Definition at line 885 of file HyperGraph.h.
| void ogdf::parallelFreeSort | ( | const Graph & | G, |
| SListPure< edge > & | edges | ||
| ) |
Sorts the edges of G such that parallel edges come after each other in the list.
| G | is the input graph. |
| edges | is assigned the list of sorted edges. |
| void ogdf::parallelFreeSortUndirected | ( | const Graph & | G, |
| SListPure< edge > & | edges, | ||
| EdgeArray< int > & | minIndex, | ||
| EdgeArray< int > & | maxIndex | ||
| ) |
Sorts the edges of G such that undirected parallel edges come after each other in the list.
An undirected parallel edges is an edge e1=(v,w) such that there exists another edge e2=(v,w) or (w,v) in the graph.
| G | is the input graph. |
| edges | is assigned the list of sorted edges. |
| minIndex | is assigned for each edge (v,w) the index min(index(v),index(w)). |
| maxIndex | is assigned for each edge (v,w) the index max(index(v),index(w)). |
| void ogdf::petersenGraph | ( | Graph & | G, |
| int | n, | ||
| int | m | ||
| ) |
Creates a generalized Petersen graph.
| G | is assigned the generated graph. |
| n | is the number of nodes on outer cycle. |
| m | is the number of jumps. |
| void ogdf::planarBiconnectedGraph | ( | Graph & | G, |
| int | n, | ||
| int | m, | ||
| bool | multiEdges = false |
||
| ) |
Creates a planar biconnected (embedded) graph.
| G | is assigned the generated graph. |
| n | is the number of nodes of the generated graph. |
| m | is the number of edges of the generated graph. |
| multiEdges | determines if the generated graph may contain multi-edges. |
| void ogdf::planarCNBGraph | ( | Graph & | G, |
| int | n, | ||
| int | m, | ||
| int | b | ||
| ) |
Creates a planar graph, that is connected, but not biconnected.
| void ogdf::planarConnectedGraph | ( | Graph & | G, |
| int | n, | ||
| int | m | ||
| ) |
Creates a connected (simple) planar (embedded) graph.
| G | is assigned the generated graph. |
| n | is the number of nodes of the generated graph. |
| m | is the number of edges of the generated graph. |
|
inline |
Returns true, if G is planar, false otherwise. If true is returned, G will be planarly embedded.
This is a shortcut for BoyerMyrvold::planarEmbed
| G | is the input graph. |
Definition at line 397 of file extended_graph_alg.h.
|
inline |
Constructs a planar embedding of G. It assumes that G is planar!
This routine is slightly faster than planarEmbed(), but requires G to be planar. If G is not planar, the graph will be destroyed while trying to embed it!
This is a shortcut for BoyerMyrvold::planarEmbedPlanarGraph().
| G | is the input graph. |
Definition at line 414 of file extended_graph_alg.h.
| void ogdf::planarTriconnectedGraph | ( | Graph & | G, |
| int | n, | ||
| int | m | ||
| ) |
Creates a planar triconnected (and simple) graph.
This graph generator works in two steps.
| G | is assigned the generated graph. |
| n | is the number of nodes in the generated graph. |
| m | is the number of edges in the generated graph. |
| void ogdf::planarTriconnectedGraph | ( | Graph & | G, |
| int | n, | ||
| double | p1, | ||
| double | p2 | ||
| ) |
Creates a planar triconnected (and simple) graph.
This graph generator creates a planar triconnected graph by successive node splitting. It starts with the \(K_4\) and performs n-4 node splits. Each such split operation distributes a node's neighbors to the two nodes resulting from the split. Aftewards, two further edges can be added; the probability for adding these edges is given by p1 and p2. The higher these probabilities, the denser the resulting graph. Note that a simple planar triconnected graph has between 1.5n and 3n-6 edges.
| G | is assigned the generated graph. |
| n | is the number of nodes in the generated graph. |
| p1 | is the probability for the first additional edge to be added. |
| p2 | is the probability for the second additional edge to be added. |
| void ogdf::print | ( | ostream & | os, |
| const BoundedQueue< E, INDEX > & | S, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const BoundedStack< E, INDEX > & | S, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const QueuePure< E > & | Q, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const Queue< E > & | Q, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const Array< E, INDEX > & | a, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const SListPure< E > & | L, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const SList< E > & | L, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const ListPure< E > & | L, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::print | ( | ostream & | os, |
| const List< E > & | L, | ||
| char | delim = ' ' |
||
| ) |
| void ogdf::quicksortTemplate | ( | LIST & | L | ) |
Definition at line 60 of file list_templates.h.
| void ogdf::quicksortTemplate | ( | LIST & | L, |
| COMPARER & | comp | ||
| ) |
Definition at line 79 of file list_templates.h.
| void ogdf::randomBiconnectedGraph | ( | Graph & | G, |
| int | n, | ||
| int | m | ||
| ) |
Creates a random biconnected graph.
| G | is assigned the generated graph. |
| n | is the number of nodes of the generated graph. |
| m | is the number of edges of the generated graph. |
| void ogdf::randomClusterGraph | ( | ClusterGraph & | C, |
| Graph & | G, | ||
| int | cNum | ||
| ) |
Assigns random clusters to a given graph G.
This function is called with a graph G and creates randomly clusters.
| G | is the input graph. |
| C | is a cluster graph for G. |
| cNum | is the maximal number of clusters introduced. |
| void ogdf::randomClusterGraph | ( | ClusterGraph & | C, |
| const Graph & | G, | ||
| const node | root, | ||
| int | moreInLeaves | ||
| ) |
Assigns a specified cluster-structure to a given graph G, and assigns vertices to clusters.
This function is called with a graph G and the root of a second graph, resembling a tree, that gives the cluster structure. Then, the vertices of G are randomly assigned to the clusters, where we can guarantee that any leaf-cluster has (on average) moreInLeaves-times more vertices than a non-leaf cluster. (E.g. if moreInLeaves = 5, any leaf will contain roughly 5 times more vertices than an inner cluster)
| C | is a cluster graph for G, to be assigned the solution. |
| G | is the input graph. |
| root | is a node in some other graph (say T). T is a tree that we will consider rooted at root. T is the pattern for the cluster hierarchy. |
| moreInLeaves | is a factor such that leaf-clusters have on average moreInLeaves-times more vertices than inner clusters |
| void ogdf::randomClusterPlanarGraph | ( | ClusterGraph & | C, |
| Graph & | G, | ||
| int | cNum | ||
| ) |
Assigns random clusters to a given graph G.
This function is called with a graph G and creates randomly clusters. The resulting cluster graph is always c-connected and, if G is planar, also c-planar.
| G | is the input graph. |
| C | is a cluster graph for G. |
| cNum | is the maximal number of Clusters introduced. |
| void ogdf::randomDiGraph | ( | Graph & | G, |
| int | n, | ||
| double | p | ||
| ) |
Creates a random (simple) directed graph.
| G | is assigned the generated graph. |
| n | is the number of nodes in the generated graph. |
| p | is the probability that an edge is created (for each node pair) |
|
inline |
|
inline |
| void ogdf::randomGraph | ( | Graph & | G, |
| int | n, | ||
| int | m | ||
| ) |
Creates a random graph.
| G | is assigned the generated graph. |
| n | is the number of nodes of the generated graph. |
| m | is the number of edges of the generated graph. |
| void ogdf::randomHierarchy | ( | Graph & | G, |
| int | n, | ||
| int | m, | ||
| bool | planar, | ||
| bool | singleSource, | ||
| bool | longEdges | ||
| ) |
Creates a random hierarchical graph.
| G | is assigned the generated graph. |
| n | is the number of nodes. |
| m | is the number of edges. |
| planar | determines if the resulting graph is (level-)planar. |
| singleSource | determines if the graph is a single-source graph. |
| longEdges | determines if the graph has long edges (spanning 2 layers or more); otherwise the graph is proper. |
|
inline |
| bool ogdf::randomSimpleGraph | ( | Graph & | G, |
| int | n, | ||
| int | m | ||
| ) |
Creates a random simple graph.
| G | is assigned the generated graph. |
| n | is the number of nodes of the generated graph. |
| m | is the number of edges of the generated graph. |
| void ogdf::randomTree | ( | Graph & | G, |
| int | n | ||
| ) |
Creates a random tree (simpler version.
| G | is assigned the tree. |
| n | is the number of nodes of the tree. |
| void ogdf::randomTree | ( | Graph & | G, |
| int | n, | ||
| int | maxDeg, | ||
| int | maxWidth | ||
| ) |
Creates a random tree.
| G | is assigned the tree. |
| n | is the number of nodes of the tree. |
| maxDeg | is the maximal allowed node degree; 0 means no restriction. |
| maxWidth | is the maximal allowed width of a level; 0 means no restriction. |
| void ogdf::randomTriconnectedGraph | ( | Graph & | G, |
| int | n, | ||
| double | p1, | ||
| double | p2 | ||
| ) |
Creates a random triconnected (and simple) graph.
The graph generator proceeds as follows. It starts with a \(K_4\) and performs then n-4 split node operations on randomly selected nodes of the graph constructed so far. Each such operation splits a node v into two nodes x and y and distributes v's neighbors to the two nodes such that each node gets at least two neighbors. Additionally, the edge (x,y) is inserted.
The neighbors are distributed such that a neighbor of v becomes
| G | is assigned the generated graph. |
| n | is the number of nodes in the generated graph. |
| p1 | is the probability that an edge is moved only to the left node after splitting a node. |
| p2 | is the probability that an edge is moved only to the right node after splitting a node. |
The probability for a neighbor to be moved to both split nodes is 1.0 - p1 - p2. The higher this probability, the higher the density of the resulting graph.
|
static |
Definition at line 791 of file HyperGraph.h.
| void ogdf::regularTree | ( | Graph & | G, |
| int | n, | ||
| int | children | ||
| ) |
Creates a regular tree.
| G | is assigned the tree. |
| n | is the number of nodes of the tree. |
| children | is the number of children per node. root has index 0, the next level has indizes 1...children, the children of node 1 have indizes children+1...2*children, etc. if number of nodes does not allow a regular node, the "last" node will have fewer children. |
| bool ogdf::saveChallengeGraph | ( | const Graph & | G, |
| const GridLayout & | gl, | ||
| ostream & | os | ||
| ) |
Writes graph G with layout gl in GD-Challenge-format to stream os.
| G | is the graph to be stored. |
| gl | is the grid layout to be stored. |
| os | is the output stream to which the graph is written. |
| bool ogdf::saveChallengeGraph | ( | const Graph & | G, |
| const GridLayout & | gl, | ||
| const char * | fileName | ||
| ) |
Writes graph G with layout gl in GD-Challenge-format to file fileName.
| G | is the graph to be stored. |
| gl | is the grid layout to be stored. |
| fileName | is the name of the file to which the graph is written. |
| bool ogdf::saveEdgeListSubgraph | ( | const Graph & | G, |
| const List< edge > & | delEdges, | ||
| ostream & | os | ||
| ) |
Writes graph G with subgraph defined by delEdges to stream os.
| G | is the graph to be stored. |
| delEdges | specifies the edges of the subgraph to be stored. |
| os | is the output stream to which the graph is written. |
| bool ogdf::saveEdgeListSubgraph | ( | const Graph & | G, |
| const List< edge > & | delEdges, | ||
| const char * | fileName | ||
| ) |
Writes graph G with subgraph defined by delEdges to file fileName.
| G | is the graph to be stored. |
| delEdges | specifies the edges of the subgraph to be stored. |
| fileName | is the name of the file to which the graph is written. |
|
inline |
| int ogdf::stNumber | ( | const Graph & | G, |
| NodeArray< int > & | numbering, | ||
| node | s = 0, |
||
| node | t = 0, |
||
| bool | randomized = false |
||
| ) |
Computes an st-Numbering of G.
| G | is the input graph. |
| numbering | is assigned the st-number for each node. |
| s | is the source node for the st-numbering. |
| t | is the target node for the st-numbering. |
| randomized | is only used when both s and t are not set (both are 0); in this case a random edge (s,t) is chosen; otherwise the first node s with degree > 0 is chosen and its first neighbor is used as t. |
|
inline |
|
inline |
|
inline |
| int ogdf::strongComponents | ( | const Graph & | G, |
| NodeArray< int > & | component | ||
| ) |
Computes the strongly connected components of the digraph G.
The function implements the algorithm by Tarjan.
| G | is the input graph. |
| component | is assigned a mapping from nodes to component numbers (0, 1, ...). |
| void ogdf::suspension | ( | Graph & | G, |
| int | s | ||
| ) |
Modifies G by adding its n-th suspension.
| G | is the graph to extend. |
| s | is the suspension. |
|
inline |
|
inline |
Definition at line 219 of file ClusterGraph.h.
|
inline |
Definition at line 226 of file ClusterGraph.h.
|
inline |
Definition at line 213 of file ClusterGraph.h.
| bool ogdf::testSTnumber | ( | const Graph & | G, |
| NodeArray< int > & | st_no, | ||
| int | max | ||
| ) |
Tests, whether a numbering of the nodes is an st-numbering.
| void ogdf::topologicalNumbering | ( | const Graph & | G, |
| NodeArray< int > & | num | ||
| ) |
Computes a topological numbering of an acyclic digraph G.
| G | is the input graph. |
| num | is assigned the topological numbering (0, 1, ...). |
| void ogdf::triangulate | ( | Graph & | G | ) |
Triangulates a planarly embedded graph G by adding edges.
The result of this function is that G is made maximally planar by adding new edges. G will also be planarly embedded such that each face is a triangle.
| G | is the input graph to which edges will be added. |
| double ogdf::usedTime | ( | double & | T | ) |
Returns used CPU time from T to current time and assigns current time to T.
|
inline |
| void ogdf::wheelGraph | ( | Graph & | G, |
| int | n | ||
| ) |
Creates the graph \(W_n^{(d)}\): A wheel graph.
| G | is assigned the generated graph. |
| n | is the number of nodes on the rim of the wheel (W_n). |
|
static |
Definition at line 781 of file HyperGraph.h.
| const char* ogdf::compressionOptionNames[] |
| const char* ogdf::interleavingOptionNames[] |
| const char* ogdf::linkOptionNames[] |
|
static |