about summary refs log tree commit diff
path: root/sourcecodes/bnt-master/graph/children.m
blob: d79701b7e48c87a2cc70bdff5a94b666222af306 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
function cs = children(adj_mat, i, t)
% CHILDREN Return the indices of a node's children in sorted order
% c = children(adj_mat, i, t)
%
% t is an optional argument: if present, dag is assumed to be a 2-slice DBN

if nargin < 3 
  cs = find(adj_mat(i,:));
else
  if t==1
    cs = find(adj_mat(i,:));
  else
    ss = length(adj_mat)/2;
    j = i+ss;
    cs = find(adj_mat(j,:)) + (t-2)*ss;
  end
end