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 File Reference

Declaration of deterministic graph generators. More...

#include <ogdf/basic/Graph.h>

Go to the source code of this file.

Namespaces

namespace  ogdf
 The namespace for all OGDF objects.
 

Functions

Deterministic graph generators
void ogdf::circulantGraph (Graph &G, int n, Array< int > jumps)
 Creates a circulant graph.
 
void ogdf::completeBipartiteGraph (Graph &G, int n, int m)
 Creates the complete bipartite graph K_{n,m}.
 
void ogdf::completeGraph (Graph &G, int n)
 Creates the complete graph K_n.
 
void ogdf::completeKPartiteGraph (Graph &G, const Array< int > &signature)
 Creates the complete k-partite graph K_{k1,k2,...,kn}.
 
void ogdf::cubeGraph (Graph &G, int n)
 Creates the graph Q^n: A n-cube graph.
 
void ogdf::customGraph (Graph &G, int n, List< std::pair< int, int > > edges)
 Creates a custom graph using a list of pairs to determine the graph's edges.
 
void ogdf::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.
 
void ogdf::emptyGraph (Graph &G, int nodes)
 Creates a graph with nodes nodes and no edges.
 
void ogdf::globeGraph (Graph &G, int meridians, int latitudes)
 Creates a globe graph with a given number of meridians and latitudes.
 
void ogdf::gridGraph (Graph &G, int n, int m, bool loopN, bool loopM)
 Creates a (toroidal) grid graph on n x m nodes.
 
void ogdf::petersenGraph (Graph &G, int n=5, int m=2)
 Creates a generalized Petersen graph.
 
void ogdf::regularLatticeGraph (Graph &G, int n, int k)
 Creates a regular lattice graph.
 
void ogdf::regularTree (Graph &G, int n, int children)
 Creates a regular tree.
 
void ogdf::suspension (Graph &G, int s)
 Modifies G by adding its s-th suspension.
 
void ogdf::wheelGraph (Graph &G, int n)
 Creates the graph W_n: A wheel graph.
 

Detailed Description

Declaration of deterministic graph generators.

Author
Carsten Gutwenger, Markus Chimani, Jöran Schierbaum
License:
This file is part of the Open Graph Drawing Framework (OGDF).
Copyright (C)
See README.md in the OGDF root directory for details.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file deterministic.h.