Skip to main content
. 2017 May 17;17(5):1144. doi: 10.3390/s17051144
Heuristic 1 (H1):
1 DO
2 Subset=F(nt,T,P);// build a subset for nt
3   P=P+|Subset|;
4     DO
5      nt.leaf=findleaf(list,Subset);//find the set of leaf nodes
6      IF Subset==∅
7        mark(nt);nt=nt.parent;P=nt.P;
8        BREAK;
9      END IF
10      J=find(nt.leaf,T,P);//find the nearest node
11      IF J==∅
12        Delete(Subset);P=P−1;
13        CONTINUE;
14      END IF
15     WHILE J~=∅
16     IF Subset==∅
17       CONTINUE;
18     END IF
19     nt={nt.num,J,P,∅};list(J)=1;
20 WHILE P == n + 1