diff toolboxes/FullBNT-1.0.7/graph/mk_rnd_dag_given_edge_prob.m @ 0:e9a9cd732c1e tip

first hg version after svn

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/toolboxes/FullBNT-1.0.7/graph/mk_rnd_dag_given_edge_prob.m	Tue Feb 10 15:05:51 2015 +0000
@@ -0,0 +1,15 @@
+function dag = sample_dag(P)
+% SAMPLE_DAG Create a random directed acyclic graph with edge probabilities P(i,j)
+% dag = sample_dag(P)
+%
+% This uses rejection sampling to reject graphs with directed cycles.
+
+done = 0;
+directed = 1;
+iter = 1;
+while ~done
+  dag = binornd(1, P); % each edge is an indep Bernoulli (0/1) random variable
+  dag = setdiag(dag, 0);
+  done = acyclic(dag, directed);
+  iter = iter + 1
+end