o 3ήcG"@sddlZddlZddlZddlmZddZddZddZd d Z d d Z d dZ ddZ ddZ ddZddZddZddZddZddZd+d!d"Zd#d$Zd%d&ZGd'd(d(Zd)d*ZdS),N)triangulate_embeddingcCs*gdddggdddgd}t|dS)Nrr)rrr)rrrrcheck_embedding_dataembedding_datar T/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/tests/test_planar_drawing.py test_graph1 s r c CsJddggdgddgdgddggdddggdgd d }t|dS) N)rr )rrrrrr)rrrr)rrr)rrrrr rrrrrrrrrrrr r r r test_graph2s rc CsNddgddgddgddgddgddgdd gdd gd dgd dgd }t|dS) Nrrrrrrrrrrrrr r r r test_circle_graphs rc CsHgdgdddggdgdddgddggd ddgd }t|dS) N)rrrrrr)rrrrrrrr)rrrr)rrrrrrrr)rrr) rrrrrrrrrrr r r r test_grid_graph.s r cCsdgi}t|dS)Nrrr r r r test_one_node_graph=s r!cCsdgdgd}t|dS)Nrrrrr r r r test_two_node_graphBs r"cCs$ddgddgddgd}t|dS)Nrrr)rrrrr r r r test_three_node_graphGs r#cCsggd}t|dS)Nrrr r r r test_multiple_component_graph1Ls  r$cCs6ddgddgddgddgddgddgd}t|dS)Nrrrrrr)rrrrrrrr r r r test_multiple_component_graph2Qs* r%cCslttj&gdgdgdgdd}t}||t|WddS1s/wYdS)N)rrr)rrr)rrrr)rrrr)pytestraisesnxNetworkXExceptionPlanarEmbeddingset_datacombinatorial_embedding_to_pos)r embeddingr r r test_invalid_half_edgeVs   "r.cCs(t}|ddgi}t||dS)Nr)r(r*add_nodecheck_triangulationr-expected_embeddingr r r test_triangulate_embedding1^s r3cCs0t}|dddgdgd}t||dS)Nrrr)r(r*connect_componentsr0r1r r r test_triangulate_embedding2es r5cCsHt|d\}}||ksJdt|d\}}||ks"JddS)NTzExpected embedding incorrectF)rget_data)r-r2 res_embedding_r r r r0ls  r0cCsnt}||t|d}d}t||sJ|t||t|d}d}t||s0J|t||dS)z8Checks that the planar embedding of the input is correctFzFPlanar drawing does not conform to the embedding (fully triangulation)TzIPlanar drawing does not conform to the embedding (internal triangulation)N)r(r*r+r,$planar_drawing_conforms_to_embeddingcheck_edge_intersections)r r- pos_fullymsgpos_internallyr r r rws    r& .>cCs(t||t|tt|t||kSN)absmax)abrel_tolabs_tolr r r is_closes(rGc Cs|\}}|\}}|\}}t||d||d} t||d||d} t||d||d} t| | | S)Nr)mathsqrtrG) rCrDpx1y1x2y2pxpydist_1_2dist_1_pdist_2_pr r r point_in_betweensrTcCs|D]\}}|D]\}}||kr||kr||kr||kr||\}}||\}} ||\} } ||\} } ||| | || | | }|dkr|| ||| | ||| | | | |}|| ||| | || | | | | |}t||||||frt||||||frd|d|}t|d}t||||||st||||||st||||||st||||||rt|q qdS)zCheck all edges in G for intersections. Raises an exception if an intersection is found. Parameters ---------- G : NetworkX graph pos : dict Maps every node to a tuple (x, y) representing its position rzThere is an intersection at ,z0A node lies on a edge connecting two other nodesN)edgesrTr(r))GposrCrDcdrKrLrMrNx3y3x4y4 determinantrOrPr<r r r r:sJ         r:c@sPeZdZdZgdZddZddZddZd d Zd d Z d dZ ddZ dS)VectorzCompare vectors by their angle without loss of precision All vectors in direction [0, 1] are the smallest. The vectors grow in clockwise direction. xynodequadrantcCsv||_||_||_|jdkr|jdkrd|_dS|jdkr'|jdkr'd|_dS|jdkr6|jdkr6d|_dSd|_dS)Nrrrrrra)selfrbrcrdr r r __init__s    zVector.__init__cCs$|j|jko|j|j|j|jkSr@rerbrcrfotherr r r __eq__s$z Vector.__eq__cCs8|j|jkrdS|j|jkrdS|j|j|j|jkS)NTFrhrir r r __lt__s  z Vector.__lt__cCs ||k Sr@r rir r r __ne__ z Vector.__ne__cCs ||k Sr@r rir r r __le__rnz Vector.__le__cCs||kSr@r rir r r __gt__sz Vector.__gt__cCs ||k Sr@r rir r r __ge__rnz Vector.__ge__N) __name__ __module__ __qualname____doc__ __slots__rgrkrlrmrorprqr r r r r`s  r`c Cs|D]}g}||}||D]}t||d|d||d|d|}||q|t|D]L\}}||dt|} ||d} |||jd| jks`|||jd| jkrddS| j|jkrr| |krrdS| j|jkr| |krdSq4qdS)zChecks if pos conforms to the planar embedding Returns true iff the neighbors are actually oriented in the orientation specified of the embedding rrcwccwFT)r`appendsort enumeratelenrd) r-rXv nbr_vectorsv_posnbr new_vectoridx nbr_vector cw_vector ccw_vectorr r r r9s, ,  r9)r>r?)rHr&networkxr("networkx.algorithms.planar_drawingrr rrr r!r"r#r$r%r.r3r5r0rrGrTr:r`r9r r r r s.   2 .