o 3ήcq3@sTddlZddlZddlmZmZmZGdddZddZddZ Gd d d Z dS) N)check_planarity_recursiveget_counterexampleget_counterexample_recursivec@seZdZdZed/ddZddZddZd d Zd d Z d dZ ddZ ddZ ddZ ddZddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.ZdS)0TestLRPlanaritya`Nose Unit tests for the :mod:`networkx.algorithms.planarity` module. Tests three things: 1. Check that the result is correct (returns planar if and only if the graph is actually planar) 2. In case a counter example is returned: Check if it is correct 3. In case an embedding is returned: Check if its actually an embedding NcCst|d\}}t|d\}}|dur*|rd}nd}||ks"J|||ks*J||r8t||t||dSt||t||dS)a,Raises an exception if the lr_planarity check returns a wrong result Parameters ---------- G : NetworkX graph is_planar : bool The expected result of the planarity check. If set to None only counter example or embedding are verified. TNz/Wrong planarity check result. Should be planar.z3Wrong planarity check result. Should be non-planar.)nxcheck_planarityrcheck_embeddingcheck_counterexample)G is_planar is_planar_lrresultis_planar_lr_rec result_recmsgrO/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/tests/test_planarity.py check_graphs  zTestLRPlanarity.check_graphcC gd}|jt|dddS)N) rrrr)rrr)r!rrrrr!r!rTr rrGraphselferrrtest_simple_planar_graph:s z(TestLRPlanarity.test_simple_planar_graphcCr)N) )rrrr)rr)rr)r!r!rrrr )rr!r"rrr!r#Tr%r&r(rrrtest_planar_with_selfloopJsz)TestLRPlanarity.test_planar_with_selfloopcCs|jtdddddS)NrFr%)rrcomplete_bipartite_graphr)rrr test_k3_3\szTestLRPlanarity.test_k3_3cCs|jtddddSNr!Fr%)rrcomplete_graphr1rrrtest_k5_szTestLRPlanarity.test_k5cCr)N)rrrrr#r!r)rrTr%r&r(rrrtest_multiple_components_planarbsz/TestLRPlanarity.test_multiple_components_planarcCs*td}|gd|j|dddS)Nr!)rr)r:rFr%)rr4add_edges_fromrr)r rrr#test_multiple_components_non_planarfs z3TestLRPlanarity.test_multiple_components_non_planarcCs6td}tdD]}|||q |j|dddSr3)rr4rangeadd_edger)r)r irrrtest_non_planar_with_selfloopms  z-TestLRPlanarity.test_non_planar_with_selfloopcCr)N) r )rrrrrrrr.)rrr#rrrFr%r&r(rrrtest_non_planar1ts z TestLRPlanarity.test_non_planar1cCs$ddg}t|}|j|dddS)Nrr,Tr%rr'rr)r*r rrr test_loop zTestLRPlanarity.test_loopcCs0ddg}t|}|dd|j|dddS)NrrrrTr%)rr' remove_edgerrGrrr test_comps  zTestLRPlanarity.test_compcCs$gd}t|}|j|dddS)N)rr-rrr rB)rr:)r r rr"rC)rr)r )rrM)rrOrr#rrDr$rr9)rrPrrM)r:rM)rPrM)rMrOTr%rFrGrrrtest_goldner_hararys z#TestLRPlanarity.test_goldner_hararycC tgd}|j|dddS)N)rrrrrr6Tr%)r MultiGraphrr<rrrtest_planar_multigraphz&TestLRPlanarity.test_planar_multigraphcCs2ttd}|dgd|j|dddS)Nr!rFr%)rrTr4r;rr<rrrtest_non_planar_multigraphsz*TestLRPlanarity.test_non_planar_multigraphcCrS)N)rrr")rr)rrrL)rrTr%)rDiGraphrr<rrrtest_planar_digraphrVz#TestLRPlanarity.test_planar_digraphcCs:ttd}|dd|dd|j|dddS)Nr!rrrFr%)rrXr4rJrr<rrrtest_non_planar_digraphs  z'TestLRPlanarity.test_non_planar_digraphcCs$t}|d|j|dddS)NrTr%)rr'add_noderr<rrrtest_single_componentrIz%TestLRPlanarity.test_single_componentcCrS)N) )rrMr rr^)rrOrr:)r:r^)rrrr)rrMrBTr%r OrderedGraphrr<rrr test_graph1szTestLRPlanarity.test_graph1cCrS)N)r)rr^)rr^r#rQrB)rrrCr7)rr^)rr:r`)rrPr]r)rr)rr:Fr%rbr<rrr test_graph2szTestLRPlanarity.test_graph2cCrS)N)ra)rrOr)r:rP)rrOrBr_rNr.r$r-)rr)r!rO)r!r^Fr%rbr<rrr test_graph3szTestLRPlanarity.test_graph3cCLttjt}|dt|WddS1swYdSNr)pytestraisesrNetworkXExceptionr'r[rr<rrrtest_counterexample_planar    "z*TestLRPlanarity.test_counterexample_planarcCrgrh)rirjrrkr'r[rr<rrr$test_counterexample_planar_recursivermz4TestLRPlanarity.test_counterexample_planar_recursive)N)__name__ __module__ __qualname____doc__ staticmethodrr+r/r2r5r8r=rArErHrKrRrUrWrYrZr\rdrerfrlrnrrrrr s2 $" rcCst|tjs td|t|jt|jksJdt}|jD] }|d|dkrC||d|df||d|dfq#|t|jksOJddS)a;Raises an exception if the combinatorial embedding is not correct Parameters ---------- G : NetworkX graph embedding : a dict mapping nodes to a list of edges This specifies the ordering of the outgoing edges from a node for a combinatorial embedding Notes ----- Checks the following things: - The type of the embedding is correct - The nodes and edges match the original graph - Every half edge has its matching opposite half edge - No intersections of edges (checked by Euler's formula) z-Bad embedding. Not of type nx.PlanarEmbeddingz4Bad embedding. Nodes don't match the original graph.rrz4Bad embedding. Edges don't match the original graph.N) isinstancerPlanarEmbeddingrkcheck_structuresetnodesedgesadd)r embeddingg_edgesedgerrrrs&    rcCst|}|D]}|||r|||qt|}t|dkr[|}||vr)q|j|}|dkrUt||}t |}t |}| || || || ||t|dks t|dkrqt td|sotddSt|dkrt tdd|stddStd)zRaises an exception if the counterexample is wrong. Parameters ---------- G : NetworkX graph subdivision_nodes : set A set of nodes inducing a subgraph as a counterexample rrr!zBad counter example.rrN)rr'has_edgerJlistlenpopdegreeiternextappend remove_noder? is_isomorphicr4rkr0)r sub_graphucontract contract_noder neighborsvrrrr Cs:               r c@s`eZdZddZddZddZddZd d Zd d Zd dZ ddZ ddZ e ddZ dS)TestPlanarEmbeddingClasscCs6|d}|}ddgdgdgd}||ksJdS)Nrrrr)rrr)get_star_embeddingget_data)r)r{datadata_cmprrr test_get_dataws z&TestPlanarEmbeddingClass.test_get_datacCsZttjt}|dd|dd|WddS1s&wYdSNrr)rirjrrkrur?rvr)r{rrrtest_missing_edge_orientation}s    "z6TestPlanarEmbeddingClass.test_missing_edge_orientationcCsfttj#t}|dd|dd|dd|WddS1s,wYdSNrrr)rirjrrkruadd_half_edge_firstr?rvrrrrtest_invalid_edge_orientations    "z6TestPlanarEmbeddingClass.test_invalid_edge_orientationcCsNttjt}|dd|WddS1s wYdSr)rirjrrkrurrvrrrrtest_missing_half_edges   "z/TestPlanarEmbeddingClass.test_missing_half_edgecCsrttj)t}tdD]}tdD] }||kr!|||qq|WddS1s2wYdS)Nr!)rirjrrkrur>rrv)r)r{r@jrrr!test_not_fulfilling_euler_formulas    "z:TestPlanarEmbeddingClass.test_not_fulfilling_euler_formulacCsHttjt}|dddWddS1swYdSr)rirjrrkruadd_half_edge_cwrrrrtest_missing_references"z/TestPlanarEmbeddingClass.test_missing_referencecCst}|dddSr)rruconnect_componentsrrrrtest_connect_componentssz0TestPlanarEmbeddingClass.test_connect_componentscCs@t}|dd|dd|dd}|ddgksJdSr)rrur traverse_face)r)r{facerrrtest_successful_face_traversals    z7TestPlanarEmbeddingClass.test_successful_face_traversalcCsjttj%t}|jddddd|jddddd|ddWddS1s.wYdS)Nrrr)ccwcw)rirjrrkrur?rrrrr test_unsuccessful_face_traversals "z9TestPlanarEmbeddingClass.test_unsuccessful_face_traversalcCs4t}td|D]}|d|||dq |S)Nrr)rrur>r)nr{r@rrrrs  z+TestPlanarEmbeddingClass.get_star_embeddingN)rorprqrrrrrrrrrrsrrrrrrvs r) rinetworkxrnetworkx.algorithms.planarityrrrrrr rrrrrs*3