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) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0.3 by Markus Kalisch, a year ago

Browse source code at https://github.com/cran/unifDAG

Authors: Markus Kalisch [aut, cre] , Manuel Schuerch [ctb]

Documentation:   PDF Manual  

GPL (>= 2) license

Imports graph, gmp, stats, methods

Suggests Rgraphviz, knitr, rmarkdown

See at CRAN