17. true graph
initial network
keep edge
and
so on
move to next edge 17

18. After all zero order conditional independence tests
The algorithm then moves to first
order conditional independence tests.

19. true graph
Move to next edge
drop edge

20. true graph
keep edge
change cond set
keep edge

21. After all first order
conditional independence tests.
The algorithm then moves to second
order conditional independence tests.

22. true graph
move to
next edge
drop edge

23. After all second order
conditional independence tests
Then the algorithm moves
to third order, fourth order …

29. true graph

37. k
save
k + 1
save
k + 2 37 37

38. from Grzegorczyk and Husmier (2008)
select edge
drop edge
identify parents
orphan nodes
reverse edge
find new parents
from Grzegorczyk and Husmier (2008)

39. from Grzegorczyk and Husmier (2008)
Trace plots of the logarithmic scores of the DAGs after the burn-in phase.
from Grzegorczyk and Husmier (2008)

45. R/qtlnet available at CRAN