HDDM/sortskeleton.m at master · YanaZeng/HDDM · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
function [ skeleton,names]=sortskeleton( skeleton,names)
%UNTITLED2 Summary of this function goes here
%   Detailed explanation goes here
[nNode]=size(skeleton, 1);

dGraph=skeleton;
%apporixmate topical sort
idx=zeros(nNode,1);
nodeFlag=true(nNode, 1);
for iPass=1:nNode
    % find the mininmal in-degree variable
    nodeIdx=find(nodeFlag==true);
    for i = 1:length(nodeIdx)
        inSum=sum(dGraph(:, nodeIdx(i)));
        if inSum ==0
            break;
        end
    end
    % remove this node and its out degree
    idx(iPass)=nodeIdx(i);
    nodeFlag(nodeIdx(i))=false;
    dGraph(nodeIdx(i), :)=0;
end
skeleton=skeleton(idx, idx);
%
% skeleton=skeleton(idx, idx);

%
% for i=1:n
%     indch=find(max(skeleton(1:m,:)>=0));
%     shunxi=indch;
%     indpc=find(skeleton(:,i)==1);
%     yuzhi=find(shunxi==i);
%     len=length(indpc);
%     if len>0
%         if indpc(len)>yuzhi
%             keyind= shunxi==i;
%             rex= shunxi==indpc(len);
%             shunxi(1,keyind)=indpc(len);
%             shunxi(1,rex)=yuzhi;
%         end
%     end
%     skeleton=skeleton(shunxi,shunxi);
%     names=names(shunxi);
% end
% for k=1:n
%     indpc=find(skeleton(:,k)==1);
%     yuzhi=find(shunxi==k);
%     len=length(indpc);
%     if len>0
%         if  indpc(len)>yuzhi
%             [ skeleton,names]=sortskeleton(skeleton,names);
%         end
%     end
% end
% end
%