U hAS@sdZddlZddlZGdddZGdddZejdejej ej ej gdd Z Gd d d Z Gd d d e ZGddde ZGddde ZGddde ZGddde ZdS)z8 Unit tests for dedensification and graph summarization Nc@sZeZdZddZddZddZeddd Zd d Zd d Z ddZ ddZ ddZ dS)TestDirectedDedensificationcCsXddddddgfdddd gfddgfg}t}|D]\}}|D]}|||q@q4|S) N1ZBC2ABC3AB64r5ZABrnxDiGraphadd_edgeselfZoriginal_matrixgraphsourcetargetstargetrP/tmp/pip-unpacked-wheel-j2te_plx/networkx/algorithms/tests/test_summarization.pybuild_original_graph s   z0TestDirectedDedensification.build_original_graphcCsfdddgfddddgfddgfd dd gfddgfd g}t}|D]\}}|D]}|||qNqB|S) Nrrrrr r r r rr)rrrrZcompressed_matrixcompressed_graphrrrrrrbuild_compressed_graphs   z2TestDirectedDedensification.build_compressed_graphcCs,t}tj|dd\}}|tks(tdS)zT Verify that an empty directed graph results in no compressor nodes  thresholdN)rr dedensifysetAssertionError)rGrc_nodesrrr test_empty+sz&TestDirectedDedensification.test_emptyTc Cs|r |}|D]v}tt||}t||}|D]}|||q6||}|D]&}||||D]}|||qhqT||q|S)a Reconstructs the original graph from a dedensified, directed graph Parameters ---------- G: dedensified graph A networkx graph compressor_nodes: iterable Iterable of compressor nodes in the dedensified graph inplace: bool, optional (default: False) Indicates if densification should be done inplace Returns ------- G: graph A densified networkx graph )copyr$r all_neighborsZ neighborsZ remove_edger remove_node) r&Zcompressor_nodesr)Zcompressor_noder*Z out_neighborsZ out_neighborZ in_neighborsZ in_neighborrrrdensify3s  z#TestDirectedDedensification.densifycCs d|_dS)N)rr'rrrr setup_methodUsz(TestDirectedDedensification.setup_methodc Cs|}|}tj|dd\}}|D]H\}}dt|}dt|}|||} |||} | | ks*tq*t |t |j kstdS)zy Verifies that dedensify produced the correct edges to/from compressor nodes in a directed graph r r!N) rrrr#edgesjoinsortedhas_edger%lenr') rr& compressed_Grr'sto_so_tZcompressed_graph_existsZverified_compressed_existsrrrtest_dedensify_edgesXs  z0TestDirectedDedensification.test_dedensify_edgescCs^|}t|}tj|dd\}}t|}||ks>t|}|t|ksZtdS)zu Verifies that dedensify produced the correct number of comrpessor nodes in a directed graph r r!N)rr5r1rr#r%r)rr&original_edge_countc_Gr'compressed_edge_countr6rrrtest_dedensify_edge_counths   z5TestDirectedDedensification.test_dedensify_edge_countcCsT|}|j||jdd}|}|D]$\}}||||||ks*tq*dS)zq Verifies that densification produces the correct edges from the original directed graph T)r)N)rr,r'rr1r4r%)rr6original_graphr&r7r8rrrtest_densify_edgesus z.TestDirectedDedensification.test_densify_edgescCsZ|}t|}|||j}t|}||ks:t|}|t|ksVtdS)zy Verifies that densification produces the correct number of edges in the original directed graph N)rr5r1r,r'r%r)rr6r>r@r<r&rrrtest_densify_edge_counts   z3TestDirectedDedensification.test_densify_edge_countN)T) __name__ __module__ __qualname__rrr( staticmethodr,r/r;r?rArBrrrrr s !  rc@s<eZdZddZddZddZddZd d Zd d Zd S)TestUnDirectedDedensificationcCsXddddddgfdddd gfddgfg}t}|D]\}}|D]}|||q@q4|S) zC Builds graph shown in the original research paper )rZCBrrr r r r rrrGraphrrrrrrs   z2TestUnDirectedDedensification.build_original_graphcCs,t}tj|dd\}}|tks(tdS)zV Verify that an empty undirected graph results in no compressor nodes r r!N)rrIr#r$r%)rr&r6r'rrrr(sz(TestUnDirectedDedensification.test_emptycCs d|_dS)N)6ABrr-r.rrrr/sz*TestUnDirectedDedensification.setup_methodc Csdddgfddgfddgfddgfd dgfd dd gfd ddgfdddgfddgfg }t}|D]\}}|D]}|||qlq`|S) Nrr CrrrrJr rr r rHrrrrrs      z4TestUnDirectedDedensification.build_compressed_graphc Cs|}tj|dd\}}|}|D]H\}}dt|}dt|}|||} |||} | | ks*tq*t |t |j kstdS)z Verifies that dedensify produced correct compressor nodes and the correct edges to/from the compressor nodes in an undirected graph r r!r0N) rrr#rr1r2r3r4r%r5r') rr&r=r'Zv_compressed_Gr7r8r9r:Zhas_compressed_edgeZverified_has_compressed_edgerrrr;s  z2TestUnDirectedDedensification.test_dedensify_edgescCsd|}tj|ddd\}}t|}t|}||ks@t|}t|}||ks`tdS)zm Verifies that dedensify produced the correct number of edges in an undirected graph r T)r"r)N)rrr#r5r1r%r)rr&r=r'r>Zverified_original_edge_countZverified_compressed_GZverified_compressed_edge_countrrrr?s    z7TestUnDirectedDedensification.test_dedensify_edge_countN) rCrDrErr(r/rr;r?rrrrrGs rG graph_typecCs(|}tj|dd}t||s$tdS)Ncolor)node_attributes)rsnap_aggregation is_isomorphicr%)rLr& summary_graphrrrtest_summarization_emptysrSc@s0eZdZdZddZddZddZdd Zd S) AbstractSNAPrMcCsdSNrr.rrrrsz!AbstractSNAP.build_original_graphcCsdSrUrr.rrrbuild_summary_graphsz AbstractSNAP.build_summary_graphcCsB|}|}d}t||j|}||}t||s>tdSNtyperrVrrPrOdeterministic_labelsrQr%rr@rRrelationship_attributesZgenerated_summary_graphZrelabeled_summary_graphrrrtest_summary_graphs zAbstractSNAP.test_summary_graphcsXtj}t|fddd}|i}t|D]\}}d|}|||<q2t|S)Ncstj|ddS)Ngroupr)r3nodes)nr&rrz3AbstractSNAP.deterministic_labels..)keyz Supernode-%s)listr`r3sort enumeraterZ relabel_nodes)rr&Z node_labelsZ label_mappingindexnodelabelrrbrr[s  z!AbstractSNAP.deterministic_labelsN)rCrDrErOrrVr^r[rrrrrTs  rTc@s(eZdZdZddZddZddZdS) TestSNAPNoEdgeTypesrcCs@|}|}d}t||j}||}t||ss$r)__doc__ZpytestZnetworkxrrrGmarkZ parametrizerIrrrrSrTrlrrrrrrrrs P ![NFG