mk_rooted_tree.m

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

function [T, pre, post, height, cycle] = mk_rooted_tree(G, root)
% MK_ROOTED_TREE  Make a directed, rooted tree out of an undirected tree.
% [T, pre, post, height, cycle] = mk_rooted_tree(G, root)

n = length(G);
T = sparse(n,n); % not the same as T = sparse(n) !
directed = 0;
[d, pre, post, height, cycle, pred] = dfs(G, root, directed);
for i=1:length(pred)
  if pred(i)>0
    T(pred(i),i)=1;
  end
end