,jC\SSKrSSKrSSKJrJrJr "SS5rSrSr "SS5r g) N)check_planarity_recursiveget_counterexampleget_counterexample_recursivech\rSrSrSr\S!Sj5rSrSrSr Sr S r S r S r S rS rSrSrSrSrSrSrSrSrSrSrSrSrSr\R<R?S\ RB\ RD45S5r#\R<R?S/SQ5S5r$S r%g)"TestLRPlanarity aHNose 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 Nc[R"US5up#[US5upEUb$U(aSnOSnX:XdU5eX:XdU5eU(a[X5 [X5 g[ X5 [ X5 g)zRaises 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 ڶC:\Users\johnn\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.13_qbz5n2kfra8p0\LocalCache\local-packages\Python313\site-packages\networkx/algorithms/tests/test_planarity.py check_graphTestLRPlanarity.check_graphs "11!T: '@D'I$  GK, 1c 1,0 5# 50  A & A * ! +  /cT/SQnUR[R"U5SS9 g)N) rrr r")r$rr)r&rrr r r&r&r$Trrr Graphselfes rtest_simple_planar_graph(TestLRPlanarity.test_simple_planar_graph:s&  !5rcT/SQnUR[R"U5SS9 g)N) )rrrr)rr)r r )r&r&rrrr%)rr&r'rrr&r(Tr*r+r-s rtest_planar_with_selfloop)TestLRPlanarity.test_planar_with_selfloopJs&  !5rcNUR[R"SS5SS9 g)NrFr*)rr complete_bipartite_graphr.s r test_k3_3TestLRPlanarity.test_k3_3\s" 44Q:eLrcLUR[R"S5SS9 gNr&Fr*)rr complete_graphr:s rtest_k5TestLRPlanarity.test_k5_s  **1-?rcT/SQnUR[R"U5SS9 g)N)rrrrr(r&r")r"r Tr*r+r-s rtest_multiple_components_planar/TestLRPlanarity.test_multiple_components_planarbs" < !5rcv[R"S5nUR/SQ5 URUSS9 g)Nr&)r#r$)rIr"Fr*)r r?add_edges_fromrr.rs r#test_multiple_components_non_planar3TestLRPlanarity.test_multiple_components_non_planarfs6   a  12 e,rc[R"S5n[S5HnURX"5 M UR USS9 gr>)r r?rangeadd_edger)r.ris rtest_non_planar_with_selfloop-TestLRPlanarity.test_non_planar_with_selfloopms?   a qA JJq  e,rcT/SQnUR[R"U5SS9 g)N) r%)rr"rr$rr"rr5)rr$r(r!r r$Fr*r+r-s rtest_non_planar1 TestLRPlanarity.test_non_planar1ts&  !6rcXSS/n[R"U5nURUSS9 g)Nrr3Tr*r r,rr.r/rs r test_loopTestLRPlanarity.test_loops, V  HHQK d+rc|SS/n[R"U5nURSS5 URUSS9 g)NrrrrTr*)r r, remove_edgerr\s r test_compTestLRPlanarity.test_comps: V  HHQK a d+rcX/SQn[R"U5nURUSS9 g)N)rr4rr r%rU)rrI)r rrrr'rV)rr$)r )rre)rrrr(r!rWr)r#rH)r$rgr$re)rIre)rgre)rerTr*r[r\s rtest_goldner_harary#TestLRPlanarity.test_goldner_hararys+ : HHQK d+rcT[R"/SQ5nURUSS9 g)N)rrrrrrCTr*)r MultiGraphrrKs rtest_planar_multigraph&TestLRPlanarity.test_planar_multigraphs$ MMJ K d+rc[R"[R"S55nURS/S-5 UR USS9 g)Nr&rFr*)r rlr?rJrrKs rtest_non_planar_multigraph*TestLRPlanarity.test_non_planar_multigraphsB MM"++A. / &A& e,rcT[R"/SQ5nURUSS9 g)N)rrr')r r)r rrd)rrTr*)r DiGraphrrKs rtest_planar_digraph#TestLRPlanarity.test_planar_digraphs$ JJO P d+rc[R"[R"S55nURSS5 URSS5 UR USS9 g)Nr&rrr Fr*)r rsr?r`rrKs rtest_non_planar_digraph'TestLRPlanarity.test_non_planar_digraphsJ JJr((+ , a a e,rcp[R"5nURS5 URUSS9 g)NrTr*)r r,add_noderrKs rtest_single_component%TestLRPlanarity.test_single_components+ HHJ 1  d+rcT[R"/SQ5nURUSS9 g)N) )rrer rr)r$rrrI)rIrrrrr$)rrerUTr*r[rKs r test_graph1TestLRPlanarity.test_graph1s* HH   d+rcT[R"/SQ5nURUSS9 g)N)r)r r)rrr(rhrUrrrVrD)r$r)r rIr)rrgr~r#)rr")rrIFr*r[rKs r test_graph2TestLRPlanarity.test_graph2s* HH  * e,rcT[R"/SQ5nURUSS9 g)N)r)rrr)rIrg)r rrUrrfr5r)r4)rr )r&r)r&rFr*r[rKs r test_graph3TestLRPlanarity.test_graph3s* HH  $ e,rc[R"[R5 [R"5nUR S5 [ U5 SSS5 g!,(df  g=fNr)pytestraisesr NetworkXExceptionr,rzrrKs rtest_counterexample_planar*TestLRPlanarity.test_counterexample_planar s> ]]2// 0 A JJqM q ! 1 0 0 2A  A.c[R"[R5 [R"5nUR S5 [ U5 SSS5 g!,(df  g=fr)rrr rr,rzrrKs r$test_counterexample_planar_recursive4TestLRPlanarity.test_counterexample_planar_recursives> ]]2// 0 A JJqM ( + 1 0 0rcdSn[R"U5n[R"U5up4USLdeURSS5 UR USS9 UR SSS5 UR SSS5 UR USS9 URS5 UR USS9 g) N)rrrrr)r rrrTrrr*rr)rr4)r r,r r`radd_half_edge_ccwadd_half_edge_cwremove_edges_from)r.edgesrcertPs r'test_edge_removal_from_planar_embedding7TestLRPlanarity.test_edge_removal_from_planar_embeddingsH HHUO$$Q't|| a d+ Aq!$ 1a# d+ ,- d+r graph_typecU"/SQ5n[R"U5up4U(deUR5n[U[R5(de[ SUR SS955(deg)N)rrrrrrrc32# UH u pU0:Hv M g7fN).0_ds r LTestLRPlanarity.test_graph_planar_embedding_to_undirected..-s>+=1AG+=sTdata)r r to_undirected isinstancer,allr)r.rrrrUs r)test_graph_planar_embedding_to_undirected9TestLRPlanarity.test_graph_planar_embedding_to_undirected&sl G H))!, y OO !RXX&&&&>1777+=>????rzreciprocal, as_view))TT)TF)FTc[R"/SQ5n[R"U5upEU(de[R"[ SS9 UR XS9 SSS5 g!,(df  g=f)N)rrrrrz%is not supported for PlanarEmbedding.match) reciprocalas_view)r r,r rr ValueErrorr)r.rrrrrs r6test_planar_embedding_to_undirected_invalid_parametersFTestLRPlanarity.test_planar_embedding_to_undirected_invalid_parameters/sW HH= >))!, y ]]:-T U OOzO CV U Us A,, A:rr)&__name__ __module__ __qualname____firstlineno____doc__ staticmethodrr0r6r;r@rErLrRrXr]rarirmrprtrwr{rrrrrrrmark parametrizer r,rlrr__static_attributes__rrrrr s"0"0H6 6$M@6--7 , , ,D,- ,- , ,"-0-*", , [[\BHHbmm+DE@F@ [[KDDrrc[U[R5(d[R"S5eUR 5 [ UR 5[ UR 5:XdS5e[ 5nURHCnUSUS:wdMURUSUS45 URUSUS45 ME U[ UR5:XdS5eg)aRaises 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 PlanarEmbeddingrcheck_structuresetnodesradd)r embeddingg_edgesedges rr r <s& i!3!3 4 4""#RSS qww<3y/ /> / eG 7d1g  KKa$q'* + KKa$q'* + c)//* *> *rc[R"U5nUH,nURX"5(dMURX"5 M. [ U5n[ U5S:aUR 5nXA;aM&URUnUS:Xag[X5n[U5n[U5nURU5 URU5 URU5 URX'5 [ U5S:aM[ U5S:XaG[R"[R"S5U5(d[R"S5eg[ U5S:XaH[R"[R "SS5U5(d[R"S5eg[R"S5e)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_edger`listlenpopdegreeiternextappend remove_noderP is_isomorphicr?rr9)r sub_graphucontract contract_noder neighborsvs rr r fs~#I   a # #  ! !! ' IH h-!    ) !!-0 Q;Y56IYAYA OOA  OOA   ! !- 0   q $# h-! ( 9~ 1 1! 4i@@&&'=> >A Y1  ; ;Aq A9MM&&'=> >N""#9::rcl\rSrSrSrSrSrSrSrSr Sr S r S r S r S rS r\S5rSrg)TestPlanarEmbeddingClassicr[R"5nURSS5 [R"[R SS9 URSSSS9 SSS5 [R"[R SS9 URSSSS 9 SSS5 [R"[R S S9 URSSSSS 9 SSS5 [R"[R S S9 URSS5 SSS5 URSSSS9 URSSSS 9 [ URS S95SSSSS.4SSSSS .4SSSSS .4/:Xdeg!,(df  GN=f!,(df  N=f!,(df  N=f!,(df  N=f)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_edgerrrsortedrr.rs rtest_add_half_edge+TestPlanarEmbeddingClass.test_add_half_edges&&( 1% ]]  (K   # #AqQ # / ]]  (R   # #Aqa # 0 ]]  (N   # #AqQA # 6 ]]  6   # #Aq )  1+1!,ioo4o01 1A& ' !A& ' !A& '6    /        s0 E4FFF(4 F F F%( F6clURS5nUR5n/SQS/S/S/S.nX#:Xdeg)Nr )rrrr)rrrr)get_star_embeddingget_data)r.rrdata_cmps r test_get_data&TestPlanarEmbeddingClass.test_get_datas@++A. !!# aSaSaS9rc [R"5nUR/SQ/SQSS//SQ/SQSS//SQS .5 URS 5 UR 5 [R"5nURSS//SQSS//S QSS/SS//SQS .5 [R R X5(deg) N)rr&r$)rrr r&rr )rr"r&r)r$rrr r$)r"rr&)rrrr r&r"r$))r&r r%)rr"r)r rset_datarrutils graphs_equal)r.rembedding_expecteds rtest_edge_removal*TestPlanarEmbeddingClass.test_edge_removals&&( q6q6   ##$45!!#//1##q6q6q6q6  xx$$YCCCCrc[R"S00S00S.5n[R"[R5 UR 5 SSS5 g!,(df  g=f)Nrrrr rrrrrrs rtest_missing_edge_orientation6TestPlanarEmbeddingClass.test_missing_edge_orientationsI&&Ar72w'?@ ]]2// 0  % % '1 0 0s A A*c[R"SSSS.0SSSS.0S00S00S.5n[R"[R5 UR 5 SSS5 g!,(df  g=f)Nrrrr)rrrrrrs rtest_invalid_edge_orientation6TestPlanarEmbeddingClass.test_invalid_edge_orientationsk&&a*+a*+r7r7   ]]2// 0  % % '1 0 0s A(( A6c[R"5nURSS5 [R"[R 5 UR 5 SSS5 g!,(df  g=fNrr)r rrrrrrrs rtest_missing_half_edge/TestPlanarEmbeddingClass.test_missing_half_edgesJ&&( 1% ]]2// 0  % % '1 0 0s A&& A4cH[R"5n[S5H0nSn[S5HnX$:wdM URX$US9 UnM M2 [R "[R 5 UR5 SSS5 g!,(df  g=f)Nr&r)r rrOrrrrr)r.rrQrefjs r!test_not_fulfilling_euler_formula:TestPlanarEmbeddingClass.test_not_fulfilling_euler_formulasz&&( qAC1X6++AS+9C ]]2// 0  % % '1 0 0s 9B B!c[R"5n[R"[RSS9 UR SSSS9 SSS5 g!,(df  g=f)NzInvalid reference node.rrrrr)r rrrrrrs rtest_missing_reference/TestPlanarEmbeddingClass.test_missing_referencesG&&( ]]2//7P Q  # #Aqa # 0R Q Qs A A"cR[R"5nURSS5 gr)r rconnect_componentsrs rtest_connect_components0TestPlanarEmbeddingClass.test_connect_componentss &&( $$Q*rc[R"5nURSS5 URSS5 URSS5nUSS/:Xdegr)r rr traverse_face)r.rfaces rtest_successful_face_traversal7TestPlanarEmbeddingClass.test_successful_face_traversal sR&&( 1%1%&&q!,1v~~rc[R"SSSS.0SSSS.0S.5n[R"[R5 UR SS5 SSS5 g!,(df  g=f)Nrrrrr)r rrrrrrs r test_unsuccessful_face_traversal9TestPlanarEmbeddingClass.test_unsuccessful_face_traversals^&&1Q'(a!1D-E F ]]2// 0  # #Aq )1 0 0s A$$ A2c[R"5nURS5 URS/5 [R "[ 5 URSS5 SSS5 [R "[ 5 URSS/5 SSS5 [R "[ 5 URSS/5 SSS5 g!,(df  N{=f!,(df  NV=f!,(df  g=f) N*)rrrrd)rri^)rr }) r rrzadd_nodes_fromrrNotImplementedErrorrPrJadd_weighted_edges_fromrs rtest_forbidden_methods/TestPlanarEmbeddingClass.test_forbidden_methodss&&( 2  (, ]]. /   q! $0 ]]. /  $ $ff%5 60 ]]. /  - -{K.H I0 / 0 / / / / /s$CC,>C= C), C:= D c[R"5nSn[SU5H'nURSX2S9 UnURUS5 M) U$)Nrrr)r rrOr)nrrrQs rr+TestPlanarEmbeddingClass.get_star_embedding$sU&&( q!A  # #Aq # 1C  # #Aq )rrN)rrrrrrrrrrrr rrrr!rrrrrrrrsU @ D<( (( (1 +* Jrr) rnetworkxr networkx.algorithms.planarityrrrrr r rrrrr(s< nDnDb 'T0;fSSr