Includes declaration of graph class.
The parameterized class Array implements dynamic arrays of type E.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
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.