Skip to main content
. 2022 Sep 24;24(10):1354. doi: 10.3390/e24101354
Algorithm 3. Query algorithm of best parent node set.
The Optimal Parent Node Set Based on Query Constraints
Input: V-set of all variables, C-set of constraints, SPG-sparse parent node graph
Output: bestsparents.,.-The best parent node set, bestscore.,.-The corresponding score
1. valid←allScoresX
2. for each Y1∈PaX∩U do
3.     valid←valid&parentsXY1
4. end for
5. for each Y2∈V\U∪noPaX\PaX do
6.     valid←valid&~parentsXY2
7. end for
8. index←firstSetBitvalid
9. return scroreXindex, parentsXindex