149 bool multiEdges =
false);
316 double width = 1.0,
double height = 1.0);
408 int N,
int K,
bool radial);
Declaration and implementation of Array class and Array algorithms.
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Includes declaration of graph class.
Basic declarations, included by all source files.
The parameterized class Array implements dynamic arrays of type E.
Data type for general directed graphs (adjacency list representation).
Class for the representation of nodes.
Declaration of randomized clustering generators.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
bool randomSimpleGraphByProbability(Graph &G, int n, double pEdge)
Creates a random simple graph.
void randomGraph(Graph &G, int n, int m)
Creates a random graph.
void randomUpwardPlanarBiconnectedDigraph(Graph &G, int n, int m)
Creates a random upward planar biconnected (embedded) digraph.
void randomPlanarBiconnectedDigraph(Graph &G, int n, int m, double p=0, bool multiEdges=false)
Creates a random planar biconnected acyclic (embedded) digraph.
void randomWaxmanGraph(Graph &G, int nodes, double alpha, double beta, double width=1.0, double height=1.0)
Generates a Waxman graph where nodes are uniformly randomly placed in a grid, then edges are inserted...
void randomChungLuGraph(Graph &G, Array< int > expectedDegreeDistribution)
Creates a graph where edges are inserted based on given weights.
void randomRegularGraph(Graph &G, int n, int d)
Creates a random d-regular graph.
void randomPlanarTriconnectedGraph(Graph &G, int n, int m)
Creates a random planar triconnected (and simple) graph.
void preferentialAttachmentGraph(Graph &G, int nodes, int minDegree)
Creates a graph where new nodes are more likely to connect to nodes with high degree.
bool randomSimpleConnectedGraph(Graph &G, int n, int m)
Creates a random simple and connected graph.
void randomTree(Graph &G, int n)
Creates a random tree (simpler version.
void pruneEdges(Graph &G, int max_edges, int min_deg)
Remove random edges from /p G until it has less than /p max_edges edges, not removing edges from node...
void randomGeometricCubeGraph(Graph &G, int nodes, double threshold, int dimension=2)
Creates a random geometric graph by laying out nodes in a unit n-cube. Nodes with a distance < thresh...
void randomHierarchy(Graph &G, int n, int m, bool planar, bool singleSource, bool longEdges)
Creates a random hierarchical graph.
void randomSeriesParallelDAG(Graph &G, int edges, double p=0.5, double flt=0.0)
Creates a random (simple, biconnected) series parallel DAG.
void randomWattsStrogatzGraph(Graph &G, int n, int k, double probability)
Creates a "small world" graph as described by Watts & Strogatz.
void randomDigraph(Graph &G, int n, double p)
Creates a random (simple) directed graph.
void randomEdgesGraph(Graph &G, std::function< double(node, node)> probability)
Inserts edges into the given graph based on probabilities given by a callback function.
bool randomSimpleGraph(Graph &G, int n, int m)
Creates a random simple graph.
void randomPlanarBiconnectedGraph(Graph &G, int n, int m, bool multiEdges=false)
Creates a random planar biconnected (embedded) graph.
void randomTriconnectedGraph(Graph &G, int n, double p1, double p2)
Creates a random triconnected (and simple) graph.
void randomPlanarCNBGraph(Graph &G, int n, int m, int b)
Creates a random planar graph, that is connected, but not biconnected.
void randomBiconnectedGraph(Graph &G, int n, int m)
Creates a random biconnected graph.
void randomPlanarConnectedGraph(Graph &G, int n, int m)
Creates a random connected (simple) planar (embedded) graph.
void randomProperMaximalLevelPlaneGraph(Graph &G, std::vector< std::vector< node > > &emb, int N, int K, bool radial)
Generates a random proper, maximal (radial) level-plane graph.
The namespace for all OGDF objects.
Implements graph generator for random geographical threshold graphs.
