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.4 Imports: graph, gmp, stats, methods Suggests: Rgraphviz, knitr, rmarkdown Published: 2024-02-06 DOI: 10.32614/CRAN.package.unifDAG 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: Reference manual: unifDAG.pdf Vignettes: A Guide to the unifDAG PackagePlease use the canonical form https://CRAN.R-project.org/package=unifDAG to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4