|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
91 int max_nodes_in_cluster = 0;
93 double prob_no_further_node = 0.1;
95 double prob_no_further_cluster = 0.0;
99 int min_root_nodes = 0;
101 bool cconnected =
false;
147 int node_per_cluster,
int edges_per_cluster);
164 int edges1,
int edges2);
176 double frac_shared = 0.34,
double frac_g1 = 0.33);
The namespace for all OGDF objects.
void randomCConnectedClustering(ClusterGraph &C, int cNum)
Creates a random c-connected clustering for a given graph G.
Includes declaration of graph class.
Parameters for the randomPlanarClustering() method.
double expected_nodes() const
Get the expected number of nodes per cluster, i.e., 1.0 / prob_no_further_node.
void randomClusterPlanarGraph(Graph &G, ClusterGraph &CG, int clusters, int node_per_cluster, int edges_per_cluster)
Create a random planar graph with a c-planar clustering.
bool randomPlanarClustering(ClusterGraph &CG, const RandomClusterConfig &config)
Creates a random c-planar clustering for a given planar graph G.
A class for modelling and solving Synchronized Planarity instances.
std::ostream & operator<<(std::ostream &os, const ogdf::Array< E, INDEX > &a)
Prints array a to output stream os.
Basic declarations, included by all source files.
void randomSEFEInstanceBySharedGraph(Graph *sefe, EdgeArray< uint8_t > &edge_types, int edges1, int edges2)
Create a (simultaneously planar) 2-SEFE instance with a given shared graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
void randomSyncPlanInstance(sync_plan::SyncPlan &pq, int pipe_count, int min_deg=3)
Create a random SynchronizedPlanarity instance by introducing pipe_count pipes between vertices of de...
void randomSEFEInstanceByUnionGraph(const Graph *sefe, EdgeArray< uint8_t > &edge_types, double frac_shared=0.34, double frac_g1=0.33)
Create a (simultaneously planar) 2-SEFE instance with a given union graph.
void expected_nodes(double n)
Set the expected number of nodes per cluster, i.e., prob_no_further_node = 1.0 / n.
void randomClustering(ClusterGraph &C, int cNum)
Creates a random clustering for a given graph G.
Representation of clustered graphs.
Class for the representation of nodes.