graph_generators.h

Go to the documentation of this file.

/*
 * $Revision: 2299 $
 * 
 * last checkin:
 *   $Author: gutwenger $ 
 *   $Date: 2012-05-07 15:57:08 +0200 (Mon, 07 May 2012) $ 
 ***************************************************************/
 
#ifdef _MSC_VER
#pragma once
#endif

#ifndef OGDF_GRAPH_GENERATORS_H
#define OGDF_GRAPH_GENERATORS_H


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

namespace ogdf {


OGDF_EXPORT void randomGraph(Graph &G, int n, int m);


OGDF_EXPORT bool randomSimpleGraph(Graph &G, int n, int m);


OGDF_EXPORT void randomBiconnectedGraph(Graph &G, int n, int m);


OGDF_EXPORT void planarConnectedGraph(Graph &G, int n, int m);


OGDF_EXPORT void planarBiconnectedGraph(Graph &G, int n, int m, bool multiEdges = false);

/*   @param n is the max. number of nodes in each biconencted component
 *   @param m is the max. number of edges in each biconnected component
 *   @param b is the number of biconnected components
 */
OGDF_EXPORT void planarCNBGraph(Graph &G, int n, int m, int b);


OGDF_EXPORT void randomTriconnectedGraph(Graph &G, int n, double p1, double p2);


OGDF_EXPORT void planarTriconnectedGraph(Graph &G, int n, int m);


OGDF_EXPORT void planarTriconnectedGraph(Graph &G, int n, double p1, double p2);


OGDF_EXPORT void randomTree(Graph& G, int n);


OGDF_EXPORT void randomTree(Graph &G, int n, int maxDeg, int maxWidth);


void regularTree(Graph& G, int n, int children);




OGDF_EXPORT void randomHierarchy(
    Graph &G,
    int n,
    int m,
    bool planar,
    bool singleSource,
    bool longEdges);


OGDF_EXPORT void randomClusterPlanarGraph(ClusterGraph &C,Graph &G,int cNum);


OGDF_EXPORT void randomClusterGraph(ClusterGraph &C,Graph &G,int cNum);



OGDF_EXPORT void randomClusterGraph(ClusterGraph& C, const Graph& G, const node root, int moreInLeaves);



OGDF_EXPORT void completeGraph(Graph &G, int n);


OGDF_EXPORT void completeBipartiteGraph(Graph &G, int n, int m);


OGDF_EXPORT void wheelGraph(Graph &G, int n);


OGDF_EXPORT void cubeGraph(Graph &G, int n);


OGDF_EXPORT void suspension(Graph &G, int s);


OGDF_EXPORT void gridGraph(Graph &G, int n, int m, bool loopN, bool loopM);


OGDF_EXPORT void petersenGraph(Graph &G, int n, int m);


OGDF_EXPORT void randomDiGraph(Graph &G, int n, double p);



}


#endif