Loading [MathJax]/extensions/tex2jax.js

Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Loading...
Searching...
No Matches
deterministic.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35
36namespace ogdf {
37
45
50OGDF_EXPORT void customGraph(Graph& G, int n, List<std::pair<int, int>> edges, Array<node>& nodes);
51
53
59inline 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
81
83
93OGDF_EXPORT void regularLatticeGraph(Graph& G, int n, int k);
94
96
103OGDF_EXPORT void regularTree(Graph& G, int n, int children);
104
106
113
115
122
124
132
134
140
142
147
149
158
160
169
171
178OGDF_EXPORT void gridGraph(Graph& G, int n, int m, bool loopN, bool loopM);
179
181
194OGDF_EXPORT void petersenGraph(Graph& G, int n = 5, int m = 2);
195
197
201OGDF_EXPORT void emptyGraph(Graph& G, int nodes);
202
204
207}
Includes declaration of graph class.
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:214
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
void circulantGraph(Graph &G, int n, Array< int > jumps)
Creates a circulant graph.
void globeGraph(Graph &G, int meridians, int latitudes)
Creates a globe graph with a given number of meridians and latitudes.
void suspension(Graph &G, int s)
Modifies G by adding its s-th suspension.
void emptyGraph(Graph &G, int nodes)
Creates a graph with nodes nodes and no edges.
void gridGraph(Graph &G, int n, int m, bool loopN, bool loopM)
Creates a (toroidal) grid graph on n x m nodes.
void regularLatticeGraph(Graph &G, int n, int k)
Creates a regular lattice graph.
void completeKPartiteGraph(Graph &G, const Array< int > &signature)
Creates the complete k-partite graph K_{k1,k2,...,kn}.
void wheelGraph(Graph &G, int n)
Creates the graph W_n: A wheel graph.
void petersenGraph(Graph &G, int n=5, int m=2)
Creates a generalized Petersen graph.
void completeBipartiteGraph(Graph &G, int n, int m)
Creates the complete bipartite graph K_{n,m}.
void completeGraph(Graph &G, int n)
Creates the complete graph K_n.
void cubeGraph(Graph &G, int n)
Creates the graph Q^n: A n-cube graph.
void regularTree(Graph &G, int n, int children)
Creates a regular tree.
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.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.