Crossings Minimization  1.0
random_dag.h
Go to the documentation of this file.
1 /**
2  * @file random_dag.h
3  * @brief Module for creating a random dag with a given number of nodes and
4  * layers.
5  *
6  * @author Matt Stallmann
7  * @date 2011/06/01
8  * $Id: random_dag.h 2 2011-06-07 19:50:41Z mfms $
9  */
10 
11 #ifndef RANDOM_DAG_H
12 #define RANDOM_DAG_H
13 
14 /**
15  * Creates a random dag with the given number of nodes and layers. Assumes
16  * that the nodes and layers of the dag have already been created, and that
17  * the master_edge_list contains the edges of the backbone tree
18  *
19  * @param branching_factor the number of chidren of a tree node is a random
20  * number in the range [1 .. branching_factor]; a large branching factor
21  * means that the variance in degree will be larger. Since the tree forms the
22  * backbone of the random dag, the same observation applies to the dag
23  */
24 void create_random_dag( int num_nodes,
25  int num_edges,
26  int num_layers,
27  int branching_factor
28  );
29 
30 #endif
31 
32 /* [Last modified: 2011 06 01 at 18:58:36 GMT] */
void create_random_dag(int num_nodes, int num_edges, int num_layers, int branching_factor)
Definition: random_dag.c:90