| Algorithm 5. Query algorithm of best parent node set. |
| The Best Parent Node Set Based on the Path Constraint Query |
|
Input: -set of all variables, set of path constraints, -sparse parent node graph Output: -the best parent node set, -the corresponding score |
| 1. 2. for each do 3. 4. end for 5. for each do 6. 7. for each Holding that in do 8. 9. 10. end for 11. 12. end for 13. for each do 14. for each Holding that in do 15. 16. end for 17. end for 18. 19. return |