Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

deterministic.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/Graph.h>
35 
36 namespace ogdf {
37 
43 
50 OGDF_EXPORT void customGraph(Graph &G, int n, List<std::pair<int,int>> edges, Array<node> &nodes);
51 
53 
59 inline void customGraph(Graph &G, int n, List<std::pair<int,int>> edges) {
60  Array<node> nodes;
61  customGraph(G, n, edges, nodes);
62 }
63 
65 
80 OGDF_EXPORT void circulantGraph (Graph &G, int n, Array<int> jumps);
81 
83 
93 OGDF_EXPORT void regularLatticeGraph(Graph &G, int n, int k);
94 
96 
103 OGDF_EXPORT void regularTree(Graph& G, int n, int children);
104 
106 
112 OGDF_EXPORT void completeGraph(Graph &G, int n);
113 
115 
121 OGDF_EXPORT void completeKPartiteGraph(Graph &G, const Array<int> &signature);
122 
124 
131 OGDF_EXPORT void completeBipartiteGraph(Graph &G, int n, int m);
132 
134 
139 OGDF_EXPORT void wheelGraph(Graph &G, int n);
140 
142 
146 OGDF_EXPORT void cubeGraph(Graph &G, int n);
147 
149 
157 OGDF_EXPORT void suspension(Graph &G, int s);
158 
160 
167 OGDF_EXPORT void gridGraph(Graph &G, int n, int m, bool loopN, bool loopM);
168 
170 
183 OGDF_EXPORT void petersenGraph(Graph &G, int n = 5, int m = 2);
184 
186 
190 OGDF_EXPORT void emptyGraph(Graph &G, int nodes);
191 
193 
196 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
Graph.h
Includes declaration of graph class.
ogdf::wheelGraph
void wheelGraph(Graph &G, int n)
Creates the graph W_n: A wheel graph.
ogdf::customGraph
void customGraph(Graph &G, int n, List< std::pair< int, int >> edges, Array< node > &nodes)
Creates a custom graph using a list of pairs to determine the graph's edges.
ogdf::completeBipartiteGraph
void completeBipartiteGraph(Graph &G, int n, int m)
Creates the complete bipartite graph K_{n,m}.
ogdf::regularTree
void regularTree(Graph &G, int n, int children)
Creates a regular tree.
ogdf::regularLatticeGraph
void regularLatticeGraph(Graph &G, int n, int k)
Creates a regular lattice graph.
ogdf::circulantGraph
void circulantGraph(Graph &G, int n, Array< int > jumps)
Creates a circulant graph.
ogdf::suspension
void suspension(Graph &G, int s)
Modifies G by adding its s-th suspension.
ogdf::emptyGraph
void emptyGraph(Graph &G, int nodes)
Creates a graph with nodes nodes and no edges.
ogdf::cubeGraph
void cubeGraph(Graph &G, int n)
Creates the graph Q^n: A n-cube graph.
ogdf::Array< node >
ogdf::completeGraph
void completeGraph(Graph &G, int n)
Creates the complete graph K_n.
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: List.h:40
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:495
ogdf::completeKPartiteGraph
void completeKPartiteGraph(Graph &G, const Array< int > &signature)
Creates the complete k-partite graph K_{k1,k2,...,kn}.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:99
ogdf::petersenGraph
void petersenGraph(Graph &G, int n=5, int m=2)
Creates a generalized Petersen graph.
ogdf::gridGraph
void gridGraph(Graph &G, int n, int m, bool loopN, bool loopM)
Creates a (toroidal) grid graph on n x m nodes.