unifDAG
Uniform Sampling of Directed Acyclic Graphs
Uniform sampling of Directed Acyclic Graphs (DAG) using exact enumeration by relating each DAG to a sequence of outpoints (nodes with no incoming edges) and then to a composition of integers as suggested by Kuipers, J. and Moffa, G. (2015) <doi:10.1007/s11222-013-9428-y>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.4 |
rolling linux/jammy R-4.5 | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
rolling linux/noble R-4.5 | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
rolling source/ R- | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
latest linux/jammy R-4.5 | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
latest linux/noble R-4.5 | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
latest source/ R- | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
2026-04-26 source/ R- | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
2026-04-23 source/ R- | unifDAG_1.0.4.tar.gz |
1.9 MiB |
1.0.4 |
2025-04-20 source/ R- | unifDAG_1.0.4.tar.gz |
1.9 MiB |