Skip to main content
. 2019 Jun 4;10:524. doi: 10.3389/fgene.2019.00524

Figure 1.

Figure 1

Illustration of how the PC algorithm works. (A) Original true causal graph. (B) PC starts with a fully-connected undirected graph. (C) The XY edge is removed because XY. (D) The XW and YW edges are removed because XW |Z and YW |Z. (E) After finding v-structures. (F) After orientation propagation.