randomized.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Array.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/graph_generators/clustering.h> // IWYU pragma: keep
#include <ogdf/basic/graph_generators/randomGeographicalThresholdGraph.h> // IWYU pragma: keep
#include <ogdf/cluster/ClusterGraph.h> // IWYU pragma: keep
 
#include <functional>
#include <vector>
 
namespace ogdf {
 
 
 
 
OGDF_EXPORT void randomRegularGraph(Graph& G, int n, int d);
 
 
OGDF_EXPORT void randomGraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT bool randomSimpleGraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT bool randomSimpleGraphByProbability(Graph& G, int n, double pEdge);
 
 
OGDF_EXPORT bool randomSimpleConnectedGraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT void randomBiconnectedGraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT void randomPlanarConnectedGraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT void randomPlanarBiconnectedGraph(Graph& G, int n, int m, bool multiEdges = false);
 
 
OGDF_EXPORT void randomPlanarBiconnectedDigraph(Graph& G, int n, int m, double p = 0,
        bool multiEdges = false);
 
 
OGDF_EXPORT void randomUpwardPlanarBiconnectedDigraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT void randomPlanarCNBGraph(Graph& G, int n, int m, int b);
 
 
OGDF_EXPORT void randomTriconnectedGraph(Graph& G, int n, double p1, double p2);
 
 
OGDF_EXPORT void randomPlanarTriconnectedGraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT void randomPlanarTriconnectedGraph(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);
 
 
OGDF_EXPORT void randomDigraph(Graph& G, int n, double p);
 
 
OGDF_EXPORT void randomSeriesParallelDAG(Graph& G, int edges, double p = 0.5, double flt = 0.0);
 
 
OGDF_EXPORT void randomGeometricCubeGraph(Graph& G, int nodes, double threshold, int dimension = 2);
 
 
OGDF_EXPORT void randomWaxmanGraph(Graph& G, int nodes, double alpha, double beta,
        double width = 1.0, double height = 1.0);
 
 
OGDF_EXPORT void preferentialAttachmentGraph(Graph& G, int nodes, int minDegree);
 
 
OGDF_EXPORT void randomWattsStrogatzGraph(Graph& G, int n, int k, double probability);
 
 
OGDF_EXPORT void randomChungLuGraph(Graph& G, Array<int> expectedDegreeDistribution);
 
 
OGDF_EXPORT void randomEdgesGraph(Graph& G, std::function<double(node, node)> probability);
 
 
OGDF_EXPORT void randomProperMaximalLevelPlaneGraph(Graph& G, std::vector<std::vector<node>>& emb,
        int N, int K, bool radial);
 
 
OGDF_EXPORT void randomHierarchy(Graph& G, int n, int m, bool planar, bool singleSource,
        bool longEdges);
 
OGDF_EXPORT void pruneEdges(Graph& G, int max_edges, int min_deg);
 
 
 
}