family.m

来自「贝叶斯网络的算法」· M 代码 · 共 18 行

function f = family(A,i,t)
% FAMILY Return the indices of parents and self in sorted order
% f = family(dag,i,t)
%
% t is an optional argument: if present, dag is assumed to be a 2-slice DBN

if nargin < 3 
  f = [parents(A,i) i];
else
  if t == 1
    f = [parents(A,i) i];
  else
    ss = length(A)/2;
    j = i+ss;
    f = [parents(A,j) j] + (t-2)*ss;
  end
end