Open
Graph Drawing
Framework

 v.2010.10
 

Namespaces | Functions

graph_generators.h File Reference

Declaration of graph generators. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/cluster/ClusterGraph.h>

Go to the source code of this file.

Namespaces

namespace  ogdf
 

The namespace for all OGDF objects.


Functions

void ogdf::randomGraph (Graph &G, int n, int m)
 Creates a random graph.
bool ogdf::randomSimpleGraph (Graph &G, int n, int m)
 Creates a random simple graph.
void ogdf::randomBiconnectedGraph (Graph &G, int n, int m)
 Creates a random biconnected graph.
void ogdf::planarBiconnectedGraph (Graph &G, int n, int m, bool multiEdges=false)
 Creates a planar biconnected (embedded) graph.
void ogdf::planarCNBGraph (Graph &G, int n, int m, int b)
 Creates a planar graph, that is connected, but not biconnected.
void ogdf::randomTriconnectedGraph (Graph &G, int n, double p1, double p2)
 Creates a random triconnected (and simple) graph.
void ogdf::planarTriconnectedGraph (Graph &G, int n, int m)
 Creates a planar triconnected (and simple) graph.
void ogdf::planarTriconnectedGraph (Graph &G, int n, double p1, double p2)
 Creates a planar triconnected (and simple) graph.
void ogdf::randomTree (Graph &G, int n, int maxDeg, int maxWidth)
 Creates a random tree.
void ogdf::randomHierarchy (Graph &G, int n, int m, bool planar, bool singleSource, bool longEdges)
 Creates a random hierarchical graph.
void ogdf::randomClusterPlanarGraph (ClusterGraph &C, Graph &G, int cNum)
 Assigns random clusters to a given graph G.
void ogdf::randomClusterGraph (ClusterGraph &C, Graph &G, int cNum)
 Assigns random clusters to a given graph G.
void ogdf::completeGraph (Graph &G, int n)
 Creates the complete graph $K_n$.
void ogdf::completeBipartiteGraph (Graph &G, int n, int m)
 Creates t complete bipartite graph $K_{n,m}$.
void ogdf::wheelGraph (Graph &G, int n)
 Creates the graph $W_n^{(d)}$: A wheel graph.
void ogdf::cubeGraph (Graph &G, int n)
 Creates the graph $Q^n$: A n-cube graph.
void ogdf::suspension (Graph &G, int s)
 Modifies G by adding its n-th suspension.
void ogdf::randomDiGraph (Graph &G, int n, double p)
 Creates a random (simple) directed graph.

Detailed Description

Declaration of graph generators.

Author:
Carsten Gutwenger, Markus Chimani
License:
This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C). All rights reserved. See README.txt in the root directory of the OGDF installation 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 and appearing in the files LICENSE_GPL_v2.txt and LICENSE_GPL_v3.txt included in the packaging of this file.
In addition, as a special exception, you have permission to link this software with the libraries of the COIN-OR Osi project (http://www.coin-or.org/projects/Osi.xml), all libraries required by Osi, and all LP-solver libraries directly supported by the COIN-OR Osi project, and distribute executables, as long as you follow the requirements of the GNU General Public License in regard to all of the software in the executable aside from these third-party libraries.
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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
See also:
http://www.gnu.org/copyleft/gpl.html

Definition in file graph_generators.h.