Nothing
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>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Markus Kalisch [aut, cre], Manuel Schuerch [ctb] |
| Maintainer | Markus Kalisch <kalisch@stat.math.ethz.ch> |
| License | GPL (>= 2) |
| Version | 1.0.3 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the unifDAG package in your browser
Any scripts or data that you put into this service are public.
