Bayesian Inference for Directed Acyclic Graphs (BiDAG)

Documentation for package ‘BiDAG’ version 1.1.2

adjacency2dag	Deriving a graph from an adjacancy matrix
Asia	Asia dataset
Boston	Boston housing data
compareDAGs	Comparing two DAGs
dag.threshold	Estimating a graph corresponding to a posterior probability threshold
dag2adjacencymatrix	Deriving an adjacency matrix of a graph
dag2skeletonadjacency	Deriving an adjacency matrix of the skeleton of a graph
DAGscore	Calculating the BGe/BDe score of a single DAG
edges.posterior	Estimating posterior probabilities of single edges
iterations.check	Performance assessment of iterative MCMC scheme against a known Bayesian network
iterativeMCMCsearch	Structure learning with an iterative order MCMC algorithm on an expanded search space
orderMCMC	Structure learning with the order MCMC algorithm
partitionMCMC	DAG structure sampling with partition MCMC
sample.check	Performance assessment of sampling algorithms against a known Bayesian network
scoreagainstDAG	Calculating the score of a sample against a DAG
scoreparameters	Initialising score object