children.m

来自「麻省理工学院的人工智能工具箱,很珍贵,希望对大家有用!」· M 代码 · 共 18 行

M
18
字号
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 DBNif 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;  endend

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?