o ]Zh@@sTddlZddlZddlmZmZmZGdddZddZddZ Gd d d Z dS) N)check_planarity_recursiveget_counterexampleget_counterexample_recursivec@seZdZdZed1ddZddZddZd d Zd d Z d dZ ddZ ddZ ddZ ddZddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.Zd/d0ZdS)2TestLRPlanaritya`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_planarZ is_planar_lrresultZis_planar_lr_recZ result_recmsgrW/var/www/auris/lib/python3.10/site-packages/networkx/algorithms/tests/test_planarity.py check_graphs  zTestLRPlanarity.check_graphcC gd}|jt|dddS)N) rrrr)rrr)rrrrrrrrTr rrGraphselferrrtest_simple_planar_graph:s z(TestLRPlanarity.test_simple_planar_graphcCr)N) )rrrr)rr)rr)rrrrrr)rrrrrrr 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|jtddddSNrFr")rrcomplete_graphr.rrrtest_k5_szTestLRPlanarity.test_k5cCr)N)rrrrr rr)rrTr"r#r%rrrtest_multiple_components_planarbsz/TestLRPlanarity.test_multiple_components_planarcCs*td}|gd|j|dddS)Nr)rr)r7rFr")rr1add_edges_fromrr&r rrr#test_multiple_components_non_planarfs z3TestLRPlanarity.test_multiple_components_non_planarcCs6td}tdD]}|||q |j|dddSr0)rr1rangeadd_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_edgerrDrrr test_comps  zTestLRPlanarity.test_compcCs$gd}t|}|j|dddS)N)rr*rrrr?)rr7)r r rrr@)rr)r )rrJ)rrLrr rrAr!rr6)rrMrrJ)r7rJ)rMrJ)rJrLTr"rCrDrrrtest_goldner_hararys z#TestLRPlanarity.test_goldner_hararycC tgd}|j|dddS)N)rrrrrr3Tr")r MultiGraphrr9rrrtest_planar_multigraphz&TestLRPlanarity.test_planar_multigraphcCs2ttd}|dgd|j|dddS)NrrFr")rrQr1r8rr9rrrtest_non_planar_multigraphsz*TestLRPlanarity.test_non_planar_multigraphcCrP)N)rrr)rr)rrrI)rrTr")rDiGraphrr9rrrtest_planar_digraphrSz#TestLRPlanarity.test_planar_digraphcCs:ttd}|dd|dd|j|dddS)NrrrrFr")rrUr1rGrr9rrrtest_non_planar_digraphs  z'TestLRPlanarity.test_non_planar_digraphcCs$t}|d|j|dddS)NrTr")rr$add_noderr9rrrtest_single_componentrFz%TestLRPlanarity.test_single_componentcCrP)N) )rrJr rr[)rrLrr7)r7r[rrrr)rrJr?Tr"rCr9rrr test_graph1szTestLRPlanarity.test_graph1cCrP)N)r)rr[)rr[r rNr?rrr@r4)rr[)rr7r])rrMrZr)rr)rr7Fr"rCr9rrr test_graph2szTestLRPlanarity.test_graph2cCrP)N)r_)rrLr)r7rM)rrLr?r\rKr+r!r*)rr)rrL)rr[Fr"rCr9rrr test_graph3szTestLRPlanarity.test_graph3cCLttjt}|dt|WddS1swYdSNr)pytestraisesrNetworkXExceptionr$rXrr9rrrtest_counterexample_planar    "z*TestLRPlanarity.test_counterexample_planarcCrdre)rfrgrrhr$rXrr9rrr$test_counterexample_planar_recursiverjz4TestLRPlanarity.test_counterexample_planar_recursivecCsd}t|}t|\}}|dusJ|dd|j|dd|ddd|ddd|j|dd|d|j|dddS) N))rrrrr)rrr^raTrrr"rr)rar*)rr$rrGrZadd_half_edge_ccwZadd_half_edge_cwremove_edges_from)r&edgesr certPrrr'test_edge_removal_from_planar_embeddings    z7TestLRPlanarity.test_edge_removal_from_planar_embedding)N)__name__ __module__ __qualname____doc__ staticmethodrr(r,r/r2r5r:r>rBrErHrOrRrTrVrWrYr`rbrcrirkrprrrrr s4 $" 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) isinstancerPlanarEmbeddingrhcheck_structuresetnodesrmadd)r embeddingZg_edgesedgerrrr's&    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 rrrzBad counter example.rrN)rr$Zhas_edgerGlistlenpopdegreeiternextappend remove_noder<Z is_isomorphicr1rhr-)r Z sub_graphuZcontractZ contract_noderZ neighborsvrrrr Qs:               r c@sxeZdZddZddZddZddZd d Zd d Zd dZ ddZ ddZ ddZ ddZ ddZeddZdS)TestPlanarEmbeddingClasscCsxt}|ddtjtjdd|jddddWdn1s%wYtjtjdd|jdddd Wdn1sEwYtjtjd d|jddddd Wdn1sfwYtjtjd d|ddWdn1swY|jdddd|jdddd t|jd ddddddfddddd fddddd fgksJdS)Nrrz!Invalid clockwise reference node.matchrrcwz(Invalid counterclockwise reference node.ccwz$Only one of cw/ccw can be specified.rrzNNode already has out-half-edge\(s\), either cw or ccw reference node required.T)data)rr)rrw add_half_edgerfrgrhsortedrmr&r|rrrtest_add_half_edges<  z+TestPlanarEmbeddingClass.test_add_half_edgecCs:|d}|}gddgdgdgd}||ksJdS)Nr)rrrr)rrrr)get_star_embeddingget_data)r&r|rZdata_cmprrr test_get_datas z&TestPlanarEmbeddingClass.test_get_datac Cst}|gdgdddggdgdddggdd |d |t}|ddggdddggd ddgddggdd tj||sPJdS) N)rrr)rrrrrr)rrrr)rrrrr)rrr)rrrrrrr))rrr)rrr)rrwset_datarlrxutilsZ graphs_equal)r&r|Zembedding_expectedrrrtest_edge_removals2  z*TestPlanarEmbeddingClass.test_edge_removalcCsRtdiidiid}ttj |WddS1s"wYdS)Nrrrrrwrfrgrhrxrrrrtest_missing_edge_orientations "z6TestPlanarEmbeddingClass.test_missing_edge_orientationcCsjtddddiddddidiidiid}ttj |WddS1s.wYdS)Nrrrr)rrrrrrrrrtest_invalid_edge_orientations   "z6TestPlanarEmbeddingClass.test_invalid_edge_orientationcCsNt}|ddttj |WddS1s wYdSNrr)rrwrrfrgrhrxrrrrtest_missing_half_edges   "z/TestPlanarEmbeddingClass.test_missing_half_edgecCs~t}tdD]}d}tdD]}||kr |j|||d|}qqttj |WddS1s8wYdS)Nrr)rrwr;rrfrgrhrx)r&r|r=refjrrr!test_not_fulfilling_euler_formulas   "z:TestPlanarEmbeddingClass.test_not_fulfilling_euler_formulacCsNt}tjtjdd|jddddWddS1s wYdS)NzInvalid reference node.rrrrr)rrwrfrgrhrrrrrtest_missing_references"z/TestPlanarEmbeddingClass.test_missing_referencecCst}|dddSr)rrwZconnect_componentsrrrrtest_connect_componentssz0TestPlanarEmbeddingClass.test_connect_componentscCs@t}|dd|dd|dd}|ddgksJdSr)rrwr traverse_face)r&r|Zfacerrrtest_successful_face_traversals    z7TestPlanarEmbeddingClass.test_successful_face_traversalcCsbtddddiddddid}ttj|ddWddS1s*wYdS)Nrrrrr)rrwrfrgrhrrrrr test_unsuccessful_face_traversals "z9TestPlanarEmbeddingClass.test_unsuccessful_face_traversalcCst}|d|dgtt|ddWdn1s%wYtt|ddgWdn1sAwYtt| ddgWddS1s^wYdS) N*)rrr^rI)rri^)rr}) rrwrXZadd_nodes_fromrfrgNotImplementedErrorr<r8Zadd_weighted_edges_fromrrrrtest_forbidden_methodss     "z/TestPlanarEmbeddingClass.test_forbidden_methodscCs@t}d}td|D]}|jd||d|}||dq |S)Nrrr)rrwr;r)nr|rr=rrrrsz+TestPlanarEmbeddingClass.get_star_embeddingN)rqrrrsrrrrrrrrrrrrrurrrrrrs    r) rfZnetworkxrZnetworkx.algorithms.planarityrrrrrr rrrrrs*3