o ßË·eq3ã@sTddlZddlZddlmZmZmZGdd„dƒZdd„Zdd„Z Gd d „d ƒZ dS) éN)Úcheck_planarity_recursiveÚget_counterexampleÚget_counterexample_recursivec@sÆeZdZdZed/dd„ƒZdd„Zdd„Zd d „Zd d „Z d d„Z dd„Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„Zdd„Zdd „Zd!d"„Zd#d$„Zd%d&„Zd'd(„Zd)d*„Zd+d,„Zd-d.„ZdS)0Ú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 NcCsˆt |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.)ÚnxÚcheck_planarityrÚcheck_embeddingÚcheck_counterexample)ÚGÚ is_planarÚ is_planar_lrÚresultÚis_planar_lr_recÚ result_recÚmsg©rú_/var/www/ideatree/venv/lib/python3.10/site-packages/networkx/algorithms/tests/test_planarity.pyÚ check_graphs  zTestLRPlanarity.check_graphcCó gd¢}|jt |¡dddS)N) ©éé©ré©ré©ré©ré)rr©ré)r!r©rr©rr!©r!rT©r ©rrÚGraph©ÚselfÚerrrÚtest_simple_planar_graph:s z(TestLRPlanarity.test_simple_planar_graphcCr)N) )rr©rr)rr)rr)r!r!r©rrr )rr!r"r©rr!r#Tr%r&r(rrrÚtest_planar_with_selfloopJsz)TestLRPlanarity.test_planar_with_selfloopcCs|jt dd¡dddS)NrFr%)rrÚcomplete_bipartite_graph©r)rrrÚ test_k3_3\szTestLRPlanarity.test_k3_3cCs|jt d¡dddS©Nr!Fr%)rrÚcomplete_graphr1rrrÚtest_k5_szTestLRPlanarity.test_k5cCr)N)rr©rrr#©r!r)rrTr%r&r(rrrÚtest_multiple_components_planarbsz/TestLRPlanarity.test_multiple_components_planarcCs*t d¡}| gd¢¡|j|dddS)Nr!)r©ré)r:rFr%)rr4Úadd_edges_fromr©r)r rrrÚ#test_multiple_components_non_planarfs z3TestLRPlanarity.test_multiple_components_non_planarcCs6t d¡}tdƒD]}| ||¡q |j|dddSr3)rr4ÚrangeÚadd_edger)r)r ÚirrrÚtest_non_planar_with_selfloopms  z-TestLRPlanarity.test_non_planar_with_selfloopcCr)N) r )rr©rr©rrrr.)rrr#r©rrFr%r&r(rrrÚtest_non_planar1ts z TestLRPlanarity.test_non_planar1cCs$ddg}t |¡}|j|dddS)Nrr,Tr%©rr'r©r)r*r rrrÚ test_loop„ó zTestLRPlanarity.test_loopcCs0ddg}t |¡}| dd¡|j|dddS)NrrrrTr%)rr'Ú remove_edgerrGrrrÚ test_compŠs  zTestLRPlanarity.test_compcCs$gd¢}t |¡}|j|dddS)N)rr-©rrr rB)rr:)ré ©ré rr"rC)rr)ré )rrM)rrOrr#rrDr$rr9)rrP©rrM)r:rM)rPrM)rMrOTr%rFrGrrrÚtest_goldner_harary‘s z#TestLRPlanarity.test_goldner_hararycCó t gd¢¡}|j|dddS)N)rrrrrr6Tr%)rÚ MultiGraphrr<rrrÚtest_planar_multigraph³óz&TestLRPlanarity.test_planar_multigraphcCs2t t d¡¡}| dgd¡|j|dddS)Nr!rFr%)rrTr4r;rr<rrrÚtest_non_planar_multigraph·sz*TestLRPlanarity.test_non_planar_multigraphcCrS)N)rrr")rr)rrrL)rrTr%)rÚDiGraphrr<rrrÚtest_planar_digraph¼rVz#TestLRPlanarity.test_planar_digraphcCs:t t d¡¡}| dd¡| dd¡|j|dddS)Nr!rrrFr%)rrXr4rJrr<rrrÚtest_non_planar_digraphÀs  z'TestLRPlanarity.test_non_planar_digraphcCs$t ¡}| d¡|j|dddS)NrTr%)rr'Úadd_noderr<rrrÚtest_single_componentÆrIz%TestLRPlanarity.test_single_componentcCrS)N) )rrM©ré ©rr^)rrO©rr:)r:r^)rr©rr)rrMrBTr%©rÚ OrderedGraphrr<rrrÚ test_graph1ÌsÿzTestLRPlanarity.test_graph1cCrS)N)r)rr^)rr^r#rQrB)rrrCr7)rr^)rr:r`)rrPr]r)rr)rr:Fr%rbr<rrrÚ test_graph2ÝsÿzTestLRPlanarity.test_graph2cCrS)N)ra)rrOr)r:rP)rrOrBr_rNr.r$r-)rr)r!rO)r!r^Fr%rbr<rrrÚ test_graph3õsÿzTestLRPlanarity.test_graph3cCóLt tj¡t ¡}| d¡t|ƒWdƒdS1swYdS©Nr)ÚpytestÚraisesrÚNetworkXExceptionr'r[rr<rrrÚtest_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 $" rcCs¢t|tjƒs t d¡‚| ¡t|jƒt|jƒksJdƒ‚tƒ}|jD] }|d|dkrC| |d|df¡| |d|df¡q#|t|jƒksOJdƒ‚dS)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) Ú isinstancerÚPlanarEmbeddingrkÚcheck_structureÚsetÚnodesÚedgesÚadd)r Ú embeddingÚg_edgesÚedgerrrrs&   ÿþ €ÿþrcCst |¡}|D]}| ||¡r| ||¡qt|ƒ}t|ƒdkr[| ¡}||vr)q|j|}|dkrUt||ƒ}t |ƒ}t |ƒ}|  |¡|  |¡|  |¡|  ||¡t|ƒdks t|ƒdkrqt  t d¡|¡sot d¡‚dSt|ƒdkrˆt  t dd¡|¡s†t d¡‚dSt d¡‚)zÉRaises 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_edgerJÚlistÚlenÚpopÚdegreeÚiterÚnextÚappendÚ remove_noder?Ú is_isomorphicr4rkr0)r Ú sub_graphÚuÚcontractÚ contract_noder‚Ú neighborsÚvrrrr Cs:   €        ï  ÿ  ÿ r c@s`eZdZdd„Zdd„Zdd„Zdd„Zd d „Zd d „Zd d„Z dd„Z dd„Z e dd„ƒZ dS)ÚTestPlanarEmbeddingClasscCs6| d¡}| ¡}ddgdgdgdœ}||ksJ‚dS)Nrrrr)rrr)Úget_star_embeddingÚget_data)r)r{ÚdataÚdata_cmprrrÚ test_get_dataws z&TestPlanarEmbeddingClass.test_get_datacCsZt tj¡t ¡}| dd¡| dd¡| ¡WdƒdS1s&wYdS©Nrr)rirjrrkrur?rv©r)r{rrrÚtest_missing_edge_orientation}s    "ûz6TestPlanarEmbeddingClass.test_missing_edge_orientationcCsft tj¡#t ¡}| dd¡| dd¡| dd¡| ¡WdƒdS1s,wYdS©Nrrr)rirjrrkruÚadd_half_edge_firstr?rvr•rrrÚtest_invalid_edge_orientation…s    "ûz6TestPlanarEmbeddingClass.test_invalid_edge_orientationcCsNt tj¡t ¡}| dd¡| ¡WdƒdS1s wYdSr”)rirjrrkrur˜rvr•rrrÚtest_missing_half_edges   "üz/TestPlanarEmbeddingClass.test_missing_half_edgecCsrt tj¡)t ¡}tdƒD]}tdƒD] }||kr!| ||¡qq| ¡WdƒdS1s2wYdS)Nr!)rirjrrkrur>r˜rv)r)r{r@ÚjrrrÚ!test_not_fulfilling_euler_formula”s   €þ "úz:TestPlanarEmbeddingClass.test_not_fulfilling_euler_formulacCsHt tj¡t ¡}| ddd¡WdƒdS1swYdSr—)rirjrrkruÚadd_half_edge_cwr•rrrÚtest_missing_references"þz/TestPlanarEmbeddingClass.test_missing_referencecCst ¡}| dd¡dSr”)rruÚconnect_componentsr•rrrÚtest_connect_components¢sz0TestPlanarEmbeddingClass.test_connect_componentscCs@t ¡}| dd¡| dd¡| dd¡}|ddgksJ‚dSr”)rrur˜Ú traverse_face)r)r{ÚfacerrrÚtest_successful_face_traversal¦s    z7TestPlanarEmbeddingClass.test_successful_face_traversalcCsjt tj¡%t ¡}|jddddd|jddddd| dd¡WdƒdS1s.wYdS)Nrrr)ÚccwÚcw)rirjrrkrur?r¡r•rrrÚ test_unsuccessful_face_traversal­s "üz9TestPlanarEmbeddingClass.test_unsuccessful_face_traversalcCs4t ¡}td|ƒD]}| d|¡| |d¡q |S)Nrr)rrur>r˜)Únr{r@rrrr´s  z+TestPlanarEmbeddingClass.get_star_embeddingN)rorprqr“r–r™ršrœržr r£r¦rsrrrrrrŽvs rŽ) riÚnetworkxrÚnetworkx.algorithms.planarityrrrrrr rŽrrrrÚs*3