U ?h\3ã@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ƒ\}}|dk rT|r0d}nd}||ksDt|ƒ‚||ksTt|ƒ‚|rnt||ƒt||ƒnt||ƒ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.)ÚnxZcheck_planarityrÚAssertionErrorÚcheck_embeddingÚcheck_counterexample)ÚGÚ is_planarZ is_planar_lrÚresultZis_planar_lr_recZ result_recÚmsg©rúZ/var/www/html/venv/lib/python3.8/site-packages/networkx/algorithms/tests/test_planarity.pyÚ check_graphs   zTestLRPlanarity.check_graphc Cs2ddddddddd d d g }|jt |¡d d dS)N©éé©ré©ré©ré©ré)rr©ré)rr©rr©rr©rrT©r ©rrÚGraph©ÚselfÚerrrÚtest_simple_planar_graph:sõ z(TestLRPlanarity.test_simple_planar_graphc Cs6ddddddddd d d d d g }|jt |¡dddS)N)rr©rr)rr)rr)rrr©rrr)rrrr©rrrTr!r"r$rrrÚtest_planar_with_selfloopJsóz)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©NrFr!)rrÚcomplete_graphr-rrrÚtest_k5_szTestLRPlanarity.test_k5cCs(ddddddg}|jt |¡dddS) Nrr©rrr©rr)rrTr!r"r$rrrÚtest_multiple_components_planarbsz/TestLRPlanarity.test_multiple_components_planarcCs,t d¡}| dddg¡|j|dddS)Nrr©ré)r6rFr!)rr0Úadd_edges_fromr©r%r rrrÚ#test_multiple_components_non_planarfs z3TestLRPlanarity.test_multiple_components_non_planarcCs6t d¡}tdƒD]}| ||¡q|j|dddSr/)rr0ÚrangeÚadd_edger)r%r ÚirrrÚtest_non_planar_with_selfloopms  z-TestLRPlanarity.test_non_planar_with_selfloopc Cs0ddddddddd d g }|jt |¡d d dS) Nr)rr©rr©rrrr*)rrrr©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„s zTestLRPlanarity.test_loopcCs0ddg}t |¡}| dd¡|j|dddS)NrrrrTr!)rr#Ú remove_edgerrCrrrÚ test_compŠs  zTestLRPlanarity.test_compcCsVddddddddd d d d d ddddddddddddddg}t |¡}|j|dddS)Nrr)©rrrr>)rr6)ré ©ré rrr?)rr)ré )rrH)rrJrrrr@r rr5)rrK©rrH)r6rH)rKrH)rHrJTr!rBrCrrrÚtest_goldner_harary‘s<å z#TestLRPlanarity.test_goldner_hararycCs(t ddddddg¡}|j|dddS)Nrrr2Tr!)rÚ MultiGraphrr8rrrÚtest_planar_multigraph³sz&TestLRPlanarity.test_planar_multigraphcCs2t t d¡¡}| dgd¡|j|dddS)NrrFr!)rrNr0r7rr8rrrÚtest_non_planar_multigraph·sz*TestLRPlanarity.test_non_planar_multigraphc Cs*t dddddddg¡}|j|dd dS) Nrrr)rr)rrrG)rrTr!)rÚDiGraphrr8rrrÚtest_planar_digraph¼sz#TestLRPlanarity.test_planar_digraphcCs:t t d¡¡}| dd¡| dd¡|j|dddS)NrrrrFr!)rrQr0rErr8rrrÚtest_non_planar_digraphÀs  z'TestLRPlanarity.test_non_planar_digraphcCs$t ¡}| d¡|j|dddS)NrTr!)rr#Úadd_noderr8rrrÚtest_single_componentÆs z%TestLRPlanarity.test_single_componentc Cs0t ddddddddd d g ¡}|j|d d dS) N)rrH©ré ©rrW)rrJ©rr6)r6rW)rr©rr)rrHr>Tr!rBr8rrrÚ test_graph1ÌsöÿzTestLRPlanarity.test_graph1cCs>t ddddddddd d d d d ddddg¡}|j|dddS)Nr)rrW)rrWrrLr>)rrr?r3)rrW)rr6rY)rrKrVr)rr)rr6Fr!rBr8rrrÚ test_graph2Ýs*ïÿzTestLRPlanarity.test_graph2cCs8t ddddddddd d d d d dg¡}|j|dddS)NrZ)rrJr)r6rK)rrJr>rXrIr*r r))rr)rrJ)rrWFr!rBr8rrrÚ test_graph3õs$òÿzTestLRPlanarity.test_graph3c Cs6t tj¡ t ¡}| d¡t|ƒW5QRXdS©Nr)ÚpytestÚraisesrÚNetworkXExceptionr#rTrr8rrrÚtest_counterexample_planar s z*TestLRPlanarity.test_counterexample_planarc Cs6t tj¡ t ¡}| d¡t|ƒW5QRXdSr^)r_r`rrar#rTrr8rrrÚ$test_counterexample_planar_recursives z4TestLRPlanarity.test_counterexample_planar_recursive)N)Ú__name__Ú __module__Ú __qualname__Ú__doc__Ú staticmethodrr'r+r.r1r4r9r=rArDrFrMrOrPrRrSrUr[r\r]rbrcrrrrr s0  $"rcCs¢t|tjƒst d¡‚| ¡t|jƒt|jƒks:tdƒ‚tƒ}|jD]@}|d|dkrF|  |d|df¡|  |d|df¡qF|t|jƒksžtdƒ‚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ÚPlanarEmbeddingraÚcheck_structureÚsetZnodesrÚedgesÚadd)r Ú embeddingZg_edgesÚedgerrrrs$   ÿþ ÿþrcCst |¡}|D]}| ||¡r| ||¡qt|ƒ}t|ƒdkr¬| ¡}||krRq4|j|}|dkr4t||ƒ}t |ƒ}t |ƒ}|  |¡|  |¡|  |¡|  ||¡q4t|ƒdkrÖt  t d¡|¡sÔt d¡‚n:t|ƒdkrt  t dd¡|¡st d¡‚n t d¡‚dS)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 rrrzBad counter example.rrN)rr#Zhas_edgerEÚlistÚlenÚpopÚdegreeÚiterÚnextÚappendÚ remove_noder;Z is_isomorphicr0rar,)r Z sub_graphÚuZcontractZ contract_nodertZ neighborsÚvrrrr Cs2           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œ}||ks2t‚dS)Nrrrr)rrr)Úget_star_embeddingÚget_datar)r%roÚdataZdata_cmprrrÚ test_get_dataws z&TestPlanarEmbeddingClass.test_get_datac CsDt tj¡.t ¡}| dd¡| dd¡| ¡W5QRXdS©Nrr)r_r`rrarjr;rk©r%rorrrÚtest_missing_edge_orientation}s   z6TestPlanarEmbeddingClass.test_missing_edge_orientationc CsPt tj¡:t ¡}| dd¡| dd¡| dd¡| ¡W5QRXdS©Nrrr)r_r`rrarjÚadd_half_edge_firstr;rkrrrrÚtest_invalid_edge_orientation…s    z6TestPlanarEmbeddingClass.test_invalid_edge_orientationc Cs8t tj¡"t ¡}| dd¡| ¡W5QRXdSr€)r_r`rrarjr„rkrrrrÚtest_missing_half_edges z/TestPlanarEmbeddingClass.test_missing_half_edgec Cs\t tj¡Ft ¡}tdƒD]&}tdƒD]}||kr*| ||¡q*q| ¡W5QRXdS)Nr)r_r`rrarjr:r„rk)r%ror<ÚjrrrÚ!test_not_fulfilling_euler_formula”s  z:TestPlanarEmbeddingClass.test_not_fulfilling_euler_formulac Cs2t tj¡t ¡}| ddd¡W5QRXdSrƒ)r_r`rrarjZadd_half_edge_cwrrrrÚtest_missing_referencesz/TestPlanarEmbeddingClass.test_missing_referencecCst ¡}| dd¡dSr€)rrjZconnect_componentsrrrrÚtest_connect_components¢sz0TestPlanarEmbeddingClass.test_connect_componentscCs@t ¡}| dd¡| dd¡| dd¡}|ddgkst ¡}|jddddd|jddddd| dd¡W5QRXdS)Nrrr)ZccwZcw)r_r`rrarjr;r‹rrrrÚ test_unsuccessful_face_traversal­s z9TestPlanarEmbeddingClass.test_unsuccessful_face_traversalcCs4t ¡}td|ƒD]}| d|¡| |d¡q|S)Nrr)rrjr:r„)Únror<rrrr|´s  z+TestPlanarEmbeddingClass.get_star_embeddingN)rdrerfrr‚r…r†rˆr‰rŠrŒrrhr|rrrrr{vs r{) r_ZnetworkxrZnetworkx.algorithms.planarityrrrrrr r{rrrrÚs*3