comparison toolboxes/FullBNT-1.0.7/graph/mk_rnd_dag_given_edge_prob.m @ 0:cc4b1211e677 tip

initial commit to HG from Changeset: 646 (e263d8a21543) added further path and more save "camirversion.m"
author Daniel Wolff
date Fri, 19 Aug 2016 13:07:06 +0200
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:cc4b1211e677
1 function dag = sample_dag(P)
2 % SAMPLE_DAG Create a random directed acyclic graph with edge probabilities P(i,j)
3 % dag = sample_dag(P)
4 %
5 % This uses rejection sampling to reject graphs with directed cycles.
6
7 done = 0;
8 directed = 1;
9 iter = 1;
10 while ~done
11 dag = binornd(1, P); % each edge is an indep Bernoulli (0/1) random variable
12 dag = setdiag(dag, 0);
13 done = acyclic(dag, directed);
14 iter = iter + 1
15 end