Skip to main content
. 2022 Sep 24;24(10):1354. doi: 10.3390/e24101354
Algorithm 4. Construction algorithm of sparse parent node graph.
Constructing Sparse Parent Node Graph Based on Path Constraints
Input:V-set of all variables,C-set of constraints,score(.,.)-decomposable score function value
Output:SPG-sparse parent node graph
1.for X∈V do
2.      if X∈endC do
3.         Construct Full Sparse Parent Graph (V, X, score(.,.))
4.      else do
5.         Construct Sparse Parent Graph without Constraints (V,X, score(.,.))
6..      end if
7. end for
8. return SPG←score·,parents·
9. Function Construct Sparse Parent Graph without Constraints (V, X, score(.,.))
10.      scoreX,parentsX←∅
11.       for layer←0 to n do
12.           for each node P such that P∈V\X&P==layer do
13.           BestScoreX,P=maxY∈PBestScoreX,P\Y
14.           if scoreX,P>BestScoreX,P
15.             BestScoreX,P←scoreX,P
16.             append scoreX,parentsX with ScoreX,P,bitnarizeP
17.          end if
18.         end for
19.      end for
20.      sort with scoreX in descending
21.       return scoreX,parentsX
22. end function
23. Function Construct Full Sparse Parent Graph (V, X, score(.,.))
24.       scoreX,parentsX←∅
25.       for each P∈V\X do
26.           Append scoreX,parentsX with ScoreX,P,bitnarizeP
27.       end for
28.       sort with scoreX in descending
29.       return scoreX,parentsX
30. end function