o 3ήc@sddlmZddlZddlZddZddZddZd d Zd d Z ej dd ddZ ej dd ddZ ej dd ddZ ej d d ddZej d d ddZejdeeeee gddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*ZdS)+) combinationsNcCs(tjdtjd}d|jd<t||S)z$Return a path graph of length three.) create_usingpathname)nx path_graphDiGraphgraphfreezeGrR/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/tests/test_d_separation.pyrs  rcC(tjdd}|ddgt||S)zReturn a three node fork graph.forkrrrrr add_edges_fromr r rrr fork_graph  rcCr)z5Return a collider/v-structure graph with three nodes.colliderrr)rrrr rrrcollider_graphrrcC(tjdd}|gdt||S)z&Return a simply Naive Bayes PGM graph. naive_bayesr)rr)rr)rrr rrrnaive_bayes_graph rr cCr)zReturn the 'Asia' PGM graph.asiar))r! tuberculosis)smokingcancer)r# bronchitis)r"either)r$r&)r&xray)r&dyspnea)r%r(rr rrr asia_graph(s  r)rcCtSNrrrrrpath_graph_fixture;r-cCr*r+rrrrrfork_graph_fixture@r.r0cCr*r+rrrrrcollider_graph_fixtureEr.r2cCr*r+)r rrrrnaive_bayes_graph_fixtureJr.r3cCr*r+r)rrrrasia_graph_fixtureOr.r5r cCsP|jD]"}t||}|jt|||h|}t||h||s%JqdS)z8Test that the Markov condition holds for each PGM graph.N)nodesset predecessorsr descendants d_separated)r nodeparentsnon_descendantsrrrtest_markov_conditionTs r>cC6t|dhdhdhs Jt|dhdhirJdS)z2Example-based test of d-separation for path_graph.rrrNrr:r,rrrtest_path_graph_dsep`rAcCr?)z2Example-based test of d-separation for fork_graph.rrrNr@r/rrrtest_fork_graph_dsepfrBrCcCs6t|dhdhis Jt|dhdhdhrJdS)z6Example-based test of d-separation for collider_graph.rrrNr@r1rrrtest_collider_graph_dseplsrDcCsPttdddD]\}}t||h|hdhsJt||h|hir%JqdS)z9Example-based test of d-separation for naive_bayes_graph.rrrN)rrangerr:)r uvrrrtest_naive_bayes_dseprsrIcCsBt|ddhddhddhsJt|ddhdhddhsJd S) z2Example-based test of d-separation for asia_graph.r!r#r(r'r%r&r"r$Nr@r4rrrtest_asia_graph_dsepys  rJcCVttjtdtj}t|dhdhdhWddS1s$wYdS)z{ Test that undirected graphs are not supported. d-separation does not apply in the case of undirected graphs. rrrrN)pytestraisesrNetworkXNotImplementedrGraphr:grrr(test_undirected_graphs_are_not_supported"rRcCrK)zr Test that cycle graphs should cause erroring. This is because PGMs assume a directed acyclic graph. rrrrN)rLrMr NetworkXError cycle_graphr r:rPrrrtest_cyclic_graphs_raise_errorrSrVcCsHttjt|dhdhdhWddS1swYdS)zJ Test that graphs that have invalid nodes passed in raise errors. rrrN)rLrMr NodeNotFoundr:r4rrrtest_invalid_nodes_raise_errors"rX) itertoolsrrLnetworkxrrrrr r)fixturer-r0r2r3r5mark parametrizer>rArCrDrIrJrRrVrXrrrrs>