| Algorithm 3. Query algorithm of best parent node set. |
| The Optimal Parent Node Set Based on Query Constraints |
|
Input: -set of all variables, -set of 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. end for 8. 9. return , |