Learning directed acyclic graphs (DAGs) through bootstrap aggregating

Documentation for package ‘dagbag’ version 1.1

example	An example with n=102 samples and p=102 nodes
score	A function to learn a DAG model by the hill climbing algorithm
score_shd	A function to use structural hamming distance to aggregate DAGs