random.graph: Generate random DAGs
In itsrainingdata/sparsebnUtils: Utilities for Learning Sparse Bayesian Networks

Generate a random graph with fixed number of edges.

1 2	random.graph(nnode, nedge, acyclic = TRUE, loops = FALSE, permute = TRUE)

`nnode`	Number of nodes in the graph.
`nedge`	Number of edges in the graph.
`acyclic`	If `TRUE`, output will be an acyclic graph.
`loops`	If `TRUE`, output may include self-loops.
`permute`	If `TRUE`, order of nodes will be randomly permuted. If `FALSE`, output will be ordered according to its topological sort, i.e. with a lower-triangular adjacency matrix.