U md3@s|ddlZddlZddlmZGdddZGdddeZGdddeZGd d d eeZGd d d Z Gd ddZ dS)N) edges_equalc@sbeZdZeejjZejZ eej j Z eej j ZeddZddZddZddZd d Zd S) TestSubGraphViewcCs$tjd|d|_dddh|_dS)N Z create_usingrr )nx path_graphgraphGhide_edges_w_hide_nodes)clsrb/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/networkx/classes/tests/test_subgraphviews.py setup_class szTestSubGraphView.setup_classcCs<dddg}tj|}|j}t|||j|d}|jj|jddhksLt|jj|j|j ksdt| rt |dgkstt |ddgkstn.t |ddgkstt |dddhkstt t|jdt t|jdt t|jd|d|r dndkst||r,d ndks8tdS) Nrr oZ filter_noderp)r filters hide_nodesgviewprintrnodesAssertionErroredgesr is_directedlistsetpytestraisesKeyError __getitem__degree is_multigraphsize)selfr nodes_gonerrrrrtest_hidden_nodess"  "z"TestSubGraphView.test_hidden_nodescCs>dddg}||}|j}||j|d}|jj|jks:t|r|jj|jdhksZtt|dgksntt|jdgkstt|jddgkst| dkstn@|jj|jdd hkstt|ddgkst| d kstt|dd gkstt t |j d t t |j d |ddks:tdS)NrrrZ filter_edgerrrrrr2r rr4)hide_edges_filterrrr r!r#r"r$predr,r&r'r(r)r*)r- hide_edges edges_gonerrrrrtest_hidden_edges&s$  z"TestSubGraphView.test_hidden_edgescCstjdddg}|j}||j|d}t|jddhksnamer! graphs_equal same_attrdictr-rHrrrtest_full_graphs  z#TestInducedSubGraph.test_full_graphcCsr|j}t|d}t|jdiiks(tt|jdiiks>tt|ddg}t|jdiidiidksntdS)Nrrrr)r_r r>dictZadjr!rfrrrtest_partial_subgraphs  z)TestInducedSubGraph.test_partial_subgraphcCs|ddd}d|jdd<|j|jks.t||jdd<|j|jksLt|jdd}d|jdd<|j|jksxt||jdd<|j|jkstdS)Nrrr^Zbaz)rrr)r"r!r )r-rgrZold_foorrrresz!TestInducedSubGraph.same_attrdictcCs*|j|jkst|j|jks t|j|jks0t|j|jks@t|s|s|jdd|jddkspt|jdd|jddkstn|s|j|_|j|_|s|j|_|j|_|j|jkst|j|jkst|jdd|jddkst|jdd|jddks&tdS)Nrr)Z_adjr!_noderrcr#Z_predZ_succ)r-rgrrrrrds" ""z TestInducedSubGraph.graphs_equalN) rErFrGrKrrhrkrerdrrrrr]s    r]c@sXeZdZeddZddZddZddZd d Zd d Z d dZ ddZ ddZ dS)TestEdgeSubGraphcCsntd|_}tdD]}d||j|d<qd|jdd<d|jdd<d|jd<t|ddg|_dS) Nr nodercedge01riedge34rr) r rrranger r"rrCrg)rrirrrrs  zTestEdgeSubGraph.setup_classcCs&ddddgt|jjdks"tdS)z.Tests that the subgraph has the correct nodes.)rnode0)rnode1)rZnode3)rZnode4rcN)sortedrgr datar!r-rrrtest_correct_nodes s  z#TestEdgeSubGraph.test_correct_nodescCs tddg|jjdstdS)z.Tests that the subgraph has the correct edges.)rrro)rrrprcN)rrgr"rvr!rwrrrtest_correct_edges&s z#TestEdgeSubGraph.test_correct_edgescCs8|jdddddgt|jjks(t|jddS)zkTests that adding a node to the original graph does not affect the nodes of the subgraph. r rrrrN)radd_noderurgr r! remove_noderwrrr test_add_node,s zTestEdgeSubGraph.test_add_nodecCsL|jddddgt|jjks&t|jjddd|jjdddddS) zeTests that removing a node in the original graph removes the nodes of the subgraph. rrrrrs)rcroN)rr{rurgr r!rzrarwrrrtest_remove_node5s z!TestEdgeSubGraph.test_remove_nodecCs|jD] }|jj||jj|kstqd|jjdd<|jjd|jjdksTtd|jjdd<|jjd|jjdkstd|jjdd<d|jjdd<dS) z`Tests that the node attribute dictionary of the two graphs is the same object. r^rrcbarrrsrtN)rgrr r!)r-vrrrtest_node_attr_dict?s z$TestEdgeSubGraph.test_node_attr_dictcCs|jD],\}}|jj||f|jj||fks tq d|jjdd<|jjdd|jjddksltd|jjdd<|jjdd|jjddkstd|jjdd<d|jjdd<dS) z`Tests that the edge attribute dictionary of the two graphs is the same object. r^rircr~rrorpN)rgr"rr!)r-urrrrtest_edge_attr_dictOs&$$z$TestEdgeSubGraph.test_edge_attr_dictcCs|jj|jjkstdS)zaTests that the graph attribute dictionary of the two graphs is the same object. N)rrrgr!rwrrrtest_graph_attr_dict_sz%TestEdgeSubGraph.test_graph_attr_dictcCsXttj|jjdttj|jjdttj|jjddttj|jjdddS)z9Tests that the subgraph cannot change the graph structurer rr rN) r&r'r Z NetworkXErrorrgrzr{rar`rwrrr test_readonlyfszTestEdgeSubGraph.test_readonlyN) rErFrGrKrrxryr|r}rrrrrrrrrms   rm) r&Znetworkxr Znetworkx.utilsrrrLrSr\r]rmrrrrs Z'8=