^jC\ddlZddlZddlmZmZmZGddZdZdZ GddZ y) N)check_planarity_recursiveget_counterexampleget_counterexample_recursivec^eZdZdZeddZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdZdZdZej:j=dej@ejBfdZ"ej:j=dgddZ#y) TestLRPlanaritya`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 Nctj|d\}}t|d\}}||rd}nd}||k(sJ|||k(sJ||rt||t||yt ||t ||y)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_recmsgs s/var/www/ramen.bs-engineer-server.com/venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_planarity.py check_graphzTestLRPlanarity.check_graphs "11!T: f'@D'I$*  GK , 1c 1, 00 5# 50  Av & Az * !F + J /cXgd}|jtj|dy)N) rrrr )r"rr)r$rrrrr$r$r"Trrr Graphselfes rtest_simple_planar_graphz(TestLRPlanarity.test_simple_planar_graph:s&  !5rcXgd}|jtj|dy)N) )rrrr)rr)rr)r$r$rrrr#)rr$r%rrr$r&Tr(r)r+s rtest_planar_with_selfloopz)TestLRPlanarity.test_planar_with_selfloopJs&  !5rcR|jtjdddy)NrFr()rr complete_bipartite_graphr,s r test_k3_3zTestLRPlanarity.test_k3_3\s" 44Q:eLrcP|jtjddyNr$Fr()rr complete_graphr6s rtest_k5zTestLRPlanarity.test_k5_s  **1-?rcXgd}|jtj|dy)N)rrrrr&r$r )r rTr(r)r+s rtest_multiple_components_planarz/TestLRPlanarity.test_multiple_components_planarbs" < !5rcztjd}|jgd|j|dy)Nr$)r!r")rBr Fr()r r:add_edges_fromrr,r s r#test_multiple_components_non_planarz3TestLRPlanarity.test_multiple_components_non_planarfs6   a  12 e,rctjd}tdD]}|j|||j |dyr9)r r:rangeadd_edger)r,r is rtest_non_planar_with_selfloopz-TestLRPlanarity.test_non_planar_with_selfloopmsF   a q A JJq!   e,rcXgd}|jtj|dy)N) r#)rr rr"rr rr2)rr"r&rrr"Fr(r)r+s rtest_non_planar1z TestLRPlanarity.test_non_planar1ts&  !6rc\ddg}tj|}|j|dy)Nrr0Tr(r r*rr,r-r s r test_loopzTestLRPlanarity.test_loops, V  HHQK d+rcddg}tj|}|jdd|j|dy)NrrrrTr()r r* remove_edgerrRs r test_compzTestLRPlanarity.test_comps: V  HHQK a d+rc\gd}tj|}|j|dy)N)rr1rrr#rL)rrB)r r rr%rM)rr")r )rrY)rr[rr&rrNr'r!rA)r"r\r"rY)rBrY)r\rY)rYr[Tr(rQrRs rtest_goldner_hararyz#TestLRPlanarity.test_goldner_hararys+ : HHQK d+rcXtjgd}|j|dy)N)rrrrrr=Tr()r MultiGraphrrDs rtest_planar_multigraphz&TestLRPlanarity.test_planar_multigraphs$ MMJ K d+rctjtjd}|jdgdz|j |dy)Nr$rFr()r r`r:rCrrDs rtest_non_planar_multigraphz*TestLRPlanarity.test_non_planar_multigraphsB MM"++A. / &A& e,rcXtjgd}|j|dy)N)rrr%)rr)rrrX)rrTr()r DiGraphrrDs rtest_planar_digraphz#TestLRPlanarity.test_planar_digraphs$ JJO P d+rctjtjd}|jdd|jdd|j |dy)Nr$rrrFr()r rer:rUrrDs rtest_non_planar_digraphz'TestLRPlanarity.test_non_planar_digraphsJ JJr((+ , a a e,rcttj}|jd|j|dy)NrTr()r r*add_noderrDs rtest_single_componentz%TestLRPlanarity.test_single_components+ HHJ 1  d+rcXtjgd}|j|dy)N) )rrYr rrn)r"r[rrB)rBrnrrrr")rrYrLTr(rQrDs r test_graph1zTestLRPlanarity.test_graph1s* HH   d+rcXtjgd}|j|dy)N)r)rrn)rrnr&r]rLrrrMr>)r"rn)rrBrp)rr\rmr!)rr )rrBFr(rQrDs r test_graph2zTestLRPlanarity.test_graph2s* HH  * e,rcXtjgd}|j|dy)N)rr)rr[r)rBr\)rr[rLrorZr2r'r1)rr)r$r[)r$rnFr(rQrDs r test_graph3zTestLRPlanarity.test_graph3s* HH  $ e,rctjtj5tj}|j dt |dddy#1swYyxYwNr)pytestraisesr NetworkXExceptionr*rjrrDs rtest_counterexample_planarz*TestLRPlanarity.test_counterexample_planar sG ]]2// 0 " A JJqM q !  " " " 1AA'ctjtj5tj}|j dt |dddy#1swYyxYwrz)r{r|r r}r*rjrrDs r$test_counterexample_planar_recursivez4TestLRPlanarity.test_counterexample_planar_recursivesG ]]2// 0 , A JJqM ( +  , , ,rcrd}tj|}tj|\}}|dusJ|jdd|j |d|j ddd|j ddd|j |d|jd|j |dy) N)rrrrr)rrrqruTrrr(rr)rur1)r r*r rUradd_half_edge_ccwadd_half_edge_cwremove_edges_from)r,edgesr certPs r'test_edge_removal_from_planar_embeddingz7TestLRPlanarity.test_edge_removal_from_planar_embeddingsH HHUO$$Q'at|| a d+ Aq!$ 1a# d+ ,- d+r graph_typec|gd}tj|\}}|sJ|j}t|tjsJt d|j dDsJy)N)rrrrrrrqc3.K|] \}}}|ik(ywN).0_ds r zLTestLRPlanarity.test_graph_planar_embedding_to_undirected..-s>1aAG>sTdata)r r to_undirected isinstancer*allr)r,rr rrUs r)test_graph_planar_embedding_to_undirectedz9TestLRPlanarity.test_graph_planar_embedding_to_undirected&sh G H))!, 1y OO !RXX&&&>1777+=>???rzreciprocal, as_view))TT)TF)FTctjgd}tj|\}}|sJtjt d5|j ||dddy#1swYyxYw)N)rrrrrqz%is not supported for PlanarEmbedding.match) reciprocalas_view)r r*r r{r| ValueErrorr)r,rrr rrs r6test_planar_embedding_to_undirected_invalid_parameterszFTestLRPlanarity.test_planar_embedding_to_undirected_invalid_parameters/sg HH= >))!, 1y ]]:-T U D OOz7O C D D Ds A,,A5r)$__name__ __module__ __qualname____doc__ staticmethodrr.r3r7r;r?rErJrOrSrVr^rarcrfrhrkrsrvrxr~rrr{mark parametrizer r*r`rrrrrrr s"0"0H6 6$M@6--7 , , ,D,- ,- , ,"-0-*", , [[\BHHbmm+DE@F@ [[KDDrrct|tjstjd|j t |j t |j k(sJdt }|jD]@}|d|dk7s|j|d|df|j|d|dfB|t |jk(sJdy)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) rr PlanarEmbeddingr}check_structuresetnodesradd)r embeddingg_edgesedges rr r <s& i!3!3 4""#RSS qww<3y/ /> / eG, 7d1g  KKa$q'* + KKa$q'* +, c)//* *> *rcXtj|}|D]'}|j||s|j||)t |}t |dkDr|j }||vr#|j|}|dk(rit||}t|}t|}|j||j||j||j||t |dkDrt |dk(r?tjtjd|stjdyt |dk(r@tjtj dd|stjdytjd)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.r rN)r r*has_edgerUlistlenpopdegreeiternextappend remove_noderH is_isomorphicr:r}r5)r sub_graphucontract contract_noder neighborsvs rr r fs#I(   a #  ! !!Q '( IH h-!    ) !!-0 Q;Y}56IYAYA OOA  OOA   ! !- 0   q! $# h-! ( 9~ 1 1! 4i@&&'=> >A Y1  ; ;Aq A9M&&'=> >N""#9::rcdeZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zed Zy)TestPlanarEmbeddingClasscztj}|jddtjtj d5|jddddddtjtj d5|jddd dddtjtj d 5|jdddd dddtjtj d 5|jddddd|jddd|jddd t |jd dddddfddddd fddddd fgk(sJy#1swY-xYw#1swYxYw#1swYxYw#1swYxYw)Nrrz!Invalid clockwise reference node.rrrcwz(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.Tr)rr)r r add_half_edger{r|r}sortedrr,rs rtest_add_half_edgez+TestPlanarEmbeddingClass.test_add_half_edges&&( 1% ]]  (K  0  # #AqQ # / 0]]  (R  1  # #Aqa # 0 1]]  (N  7  # #AqQA # 6 7]]  6  *  # #Aq ) * 1+1!,ioo4o01 1A& ' !A& ' !A& '6    / 0 0 1 1 7 7 * *s0 F FF%F1 FF"%F.1F:cl|jd}|j}gddgdgdgd}||k(sJy)Nr)rrrr)rrrr)get_star_embeddingget_data)r,rrdata_cmps r test_get_dataz&TestPlanarEmbeddingClass.test_get_datasB++A. !!# aSaSaS9xrc vtj}|jgdgdddggdgdddggdd |jd |j tj}|jddggdddggd ddgddggdd tj j ||sJy) N)rr$r")rrrr$rr)rr r$r)r"rrrr")r rr$)rrrrr$r r"))r$rr#)rr r)r rset_datarrutils graphs_equal)r,rembedding_expecteds rtest_edge_removalz*TestPlanarEmbeddingClass.test_edge_removals&&( q6q6   ##$45!!#//1##q6q6q6q6  xx$$Y0BCCCrctjdiidiid}tjtj5|j dddy#1swYyxYw)Nrrrr rr{r|r}rrs rtest_missing_edge_orientationz6TestPlanarEmbeddingClass.test_missing_edge_orientationsR&&Ar72w'?@ ]]2// 0 (  % % ' ( ( (s AA#ctjddddiddddidiidiid}tjtj5|j dddy#1swYyxYw)Nrrrr)rrrrrrs rtest_invalid_edge_orientationz6TestPlanarEmbeddingClass.test_invalid_edge_orientationst&&a*+a*+r7r7   ]]2// 0 (  % % ' ( ( (s A&&A/ctj}|jddtjtj 5|j dddy#1swYyxYwNrr)r rrr{r|r}rrs rtest_missing_half_edgez/TestPlanarEmbeddingClass.test_missing_half_edgesS&&( 1% ]]2// 0 (  % % ' ( ( (s A$$A-c8tj}tdD]0}d}tdD]}||k7s |j||||} 2t j tj 5|jdddy#1swYyxYw)Nr$r)r rrGrr{r|r}r)r,rrIrefjs r!test_not_fulfilling_euler_formulaz:TestPlanarEmbeddingClass.test_not_fulfilling_euler_formulas&&( q AC1X 6++AqS+9C   ]]2// 0 (  % % ' ( ( (s 6BBctj}tjtjd5|j ddddddy#1swYyxYw)NzInvalid reference node.rrrrr)r rr{r|r}rrs rtest_missing_referencez/TestPlanarEmbeddingClass.test_missing_referencesO&&( ]]2//7P Q 1  # #Aqa # 0 1 1 1s AA!cPtj}|jddyr)r rconnect_componentsrs rtest_connect_componentsz0TestPlanarEmbeddingClass.test_connect_componentss &&( $$Q*rctj}|jdd|jdd|jdd}|ddgk(sJyr)r rr traverse_face)r,rfaces rtest_successful_face_traversalz7TestPlanarEmbeddingClass.test_successful_face_traversal sR&&( 1%1%&&q!,1v~~rctjddddiddddid}tjtj5|j dddddy#1swYyxYw)Nrrrrr)r rr{r|r}rrs r test_unsuccessful_face_traversalz9TestPlanarEmbeddingClass.test_unsuccessful_face_traversalsg&&1Q'(a!1D-E F ]]2// 0 *  # #Aq ) * * *s A""A+ctj}|jd|jdgt j t 5|jdddddt j t 5|jddgdddt j t 5|jddgdddy#1swYtxYw#1swYKxYw#1swYyxYw) N*)rrrqrX)rri^)rr}) r rrjadd_nodes_fromr{r|NotImplementedErrorrHrCadd_weighted_edges_fromrs rtest_forbidden_methodsz/TestPlanarEmbeddingClass.test_forbidden_methodss&&( 2  (, ]]. / %   q! $ % ]]. / 7  $ $ff%5 6 7 ]]. / J  - -{K.H I J J  % % 7 7 J Js$CC#:C/C #C,/C8ctj}d}td|D]*}|jd|||}|j|d,|S)Nrrr)r rrGr)nrrrIs rrz+TestPlanarEmbeddingClass.get_star_embedding$s\&&( q! *A  # #AqS # 1C  # #Aq ) *rN)rrrrrrrrrrrrrrrrrrrrrrsU @ D<( (( (1 +* Jrr) r{networkxr networkx.algorithms.planarityrrrrr r rrrrrs< nDnDb 'T0;fSSr