Simulates a random directed acyclic graph adjacency (DAG) matrix with n nodes
and either m edges, edge creation probability p, or edge creation
probability range p_range.
Examples
# Simulate a DAG with 5 nodes and 3 edges
sim_dag(n = 5, m = 3)
#> <caugi object; 5 nodes, 3 edges; simple: TRUE; built: TRUE; ptr=0x556d9dfee5d0>
#> graph_class: DAG
#> nodes: V1, V2, V3, V4, V5
#> edges: V3-->V1, V4-->V1, V4-->V3
# Simulate a DAG with 5 nodes and edge creation probability of 0.2
sim_dag(n = 5, p = 0.2)
#> <caugi object; 5 nodes, 2 edges; simple: TRUE; built: TRUE; ptr=0x556d93f62830>
#> graph_class: DAG
#> nodes: V1, V2, V3, V4, V5
#> edges: V2-->V1, V2-->V5
