| Algorithm 4. Construction algorithm of sparse parent node graph. |
| Constructing Sparse Parent Node Graph Based on Path Constraints |
|
Input:-set of all variables,-set of constraints,-decomposable score function value Output:-sparse parent node graph |
| 1.for
do 2. if do 3. Construct Full Sparse Parent Graph (, , ) 4. else do 5. Construct Sparse Parent Graph without Constraints (, ) 6.. end if 7. end for 8. return 9. Function Construct Sparse Parent Graph without Constraints (, , ) 10. 11. for do 12. for each node such that do 13. 14. if 15. 16. append with 17. end if 18. end for 19. end for 20. sort with in descending 21. return 22. end function 23. Function Construct Full Sparse Parent Graph (, , ) 24. 25. for each do 26. Append with 27. end for 28. sort with in descending 29. return 30. end function |