Daniel@0: function [dag, order] = mk_rnd_dag(N, max_fan_in)
Daniel@0: % MY_MK_RND_DAG  Create a random directed acyclic graph
Daniel@0: %
Daniel@0: % [dag, order] = my_mk_rnd_dag(N, max_fan_in)
Daniel@0: %  max_fan_in defaults to N.
Daniel@0: %  order is the random topological order that was chosen
Daniel@0: 
Daniel@0: % Modified by Sonia Leach 2/25/02
Daniel@0: 
Daniel@0: if nargin < 2, max_fan_in = N; end
Daniel@0: 
Daniel@0: order = randperm(N);
Daniel@0: dag = zeros(N,N);
Daniel@0: for i=2:N
Daniel@0:   j = order(i);
Daniel@0:   %k = sample_discrete(normalise(ones(1, min(i-1, max_fan_in))));
Daniel@0:   k = sample_discrete(normalise(ones(1, min(i-1, max_fan_in)+1))) - 1; % min = 0 (bug fix due to
Daniel@0:                                                                        % Pedrito, 7/28/04)
Daniel@0:   SS = order(1:i-1);          % get Set of possible parentS
Daniel@0:   p  = randperm(length(SS));  % permute order of set
Daniel@0:   dag(SS(p(1:k)),j) = 1;      % take first k in permuted order
Daniel@0: 
Daniel@0:   % Kevin had:
Daniel@0:   %SS = subsets(order(1:i-1), k, k);
Daniel@0:   %p = sample_discrete(normalise(ones(1, length(SS))));
Daniel@0:   %dag(SS{p}, j) = 1;
Daniel@0: end