After simulating a random topological order first (the order can also be prespecified), the algorithm connects two nodes with the porbability probConnect.

1 |

`p` |
number of nodes. |

`probConnect` |
probability of connecting two nodes, determines the sparsity of the graph. Choosing probConnect = 2/(p-1), for example, leads to an expected number of p nodes. |

`causalOrder` |
OPTIONAL: causal or topological order of the nodes. If not provided, the topological order is chosen randomly. |

p x p adjacency matrix that describes a directed acyclic graph (DAG) with p nodes. The entry (i,j) equals one if and only if there is an edge from i to j.

Jonas Peters <jonas.peters@tuebingen.mpg.de>

`structIntervDist`

`hammingDist`

1 | ```
randomDAG(p = 5, probConnect = 0.6)
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.