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>.
| Version: |
1.0.3 |
| Imports: |
graph, gmp, stats, methods |
| Suggests: |
Rgraphviz, knitr, rmarkdown |
| Published: |
2019-11-20 |
| Author: |
Markus Kalisch [aut, cre],
Manuel Schuerch [ctb] |
| Maintainer: |
Markus Kalisch <kalisch at stat.math.ethz.ch> |
| License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: |
no |
| CRAN checks: |
unifDAG results |
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=unifDAG
to link to this page.