o 3ήc[@sddlZddlZddlmZddZddZddZd d Zd d Z d dZ ddZ ddZ ddZ ddZddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.Zd/d0Zd1d2Zd3d4Zd5d6ZdS)7N)directedcCst}t}t|}t|}tj|dd}tj|dd}tj|ddd}tj|dd}||ks5J||ks;J||ksAJ||ksGJ||ksMJdS) zD empty graphs should give hashes regardless of other params edge_attr1 edge_attr node_attr1 node_attrrr  iterationsN)nx empty_graphweisfeiler_lehman_graph_hash)G1G2h1h2h3h4h5h6rS/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/tests/test_graph_hashing.pytest_empty_graph_hash s      rcCVd}t|D]"}tjd|d|d}t|}t|}t|}||ks(JqdS)z A directed graph with no bi-directional edges should yield different a graph hash to the same graph taken as undirected if there are no hash collisions. r dseedN)ranger gn_graph to_undirectedr)ri G_directed G_undirected h_directed h_undirectedrrr test_directed     r(cCbtjdtjd}tj|dd|Ddd|}tj|dd}tj|dd}||ks/JdS) z A directed graph with no bi-directional edges should yield different a graph hash to the same graph taken with edge directions reversed if there are no hash collisions. Here we test a cycle graph which is the minimal counterexample  create_usingcSi|]}|t|qSrstr.0nrrr 7z!test_reversed..labelnamerN)r cycle_graphDiGraphset_node_attributesnodesreverserG G_reversedh h_reversedrrr test_reversed0 rCcCszd\}}d|}td|dD]+}tj|||d|d}t|dd|D}t|}t|}||ks:JqdS) zt graph hashes should be invariant to node-relabeling (when the output is reindexed by the same mapping) rr ?rcSi|]}|d|qSrr2urrrr4Jr5z#test_isomorphic..N)rr erdos_renyi_graph relabel_nodesr<r)r3r"pr#rrg1_hashg2_hashrrrtest_isomorphicAs  rSc Cs$d\}}d|}td|dD]}tj|||d|d}|jD] \}}|d|d|||d<|d|d |||d <q tj|dd }tj|d d }tj|d d } || ks\J|| ksbJ||kshJt|d d|D} tj| dd } tj| d d } || ksJ|| ksJqd S)a Isomorphic graphs with differing edge attributes should yield different graph hashes if the 'edge_attr' argument is supplied and populated in the graph, and there are no hash collisions. The output should still be invariant to node-relabeling rErFrG,r--1r-2 edge_attr2rNcSrIrJrrLrrrr4nr5z-test_isomorphic_edge_attr..)rr rNedgesrrOr< r3r"rPr#rabg1_hash_with_edge_attr1g1_hash_with_edge_attr2g1_hash_no_edge_attrrg2_hash_with_edge_attr1g2_hash_with_edge_attr2rrrtest_isomorphic_edge_attrRs6    rbcC>t}|ddddifddifgtjttj|dddSzz If the 'edge_attr' argument is supplied but is missing from an edge in the graph, we should raise a KeyError rGrr[rN)r Graphadd_edges_frompytestraisesKeyErrorrr?rrrtest_missing_edge_attr{srmc Csd\}}d|}td|dD]w}tj|||d|d}|D]}|d|j|d<|d|j|d <q!tj|dd }tj|d d }tj|d d }||ksSJ||ksYJ||ks_Jt|d d |D} tj| dd } tj| d d } || ksJ|| ksJqd S)a Isomorphic graphs with differing node attributes should yield different graph hashes if the 'node_attr' argument is supplied and populated in the graph, and there are no hash collisions. The output should still be invariant to node-relabeling rErFrGrrVrrW node_attr2rNcSrIrJrrLrrrr4r5z-test_isomorphic_node_attr..)rr rNr<rrO r3r"rPr#rrMg1_hash_with_node_attr1g1_hash_with_node_attr2g1_hash_no_node_attrrg2_hash_with_node_attr1g2_hash_with_node_attr2rrrtest_isomorphic_node_attrs6     rvcCHt}|dddifdifg|gdtjttj|dddSzy If the 'node_attr' argument is supplied but is missing from a node in the graph, we should raise a KeyError rGrr[re))rGre)rerf)rfrG)rGrN)r rgadd_nodes_fromrhrirjrkrrlrrrtest_missing_node_attrsr{cCsd\}}d|}td|dD]}tj|||d|d}|D]}|d|j|d<|d|j|d <q!|jD] \}}|d |d|||d <|d |d|||d <q;tj|d dd }tj|d d d } tj|d d d } t|} || ksJ| | ksJ|| ksJ| | ksJ| |ksJt|dd|D} tj| d dd } tj| d d d }|| ksJ| |ksJqdS)a Isomorphic graphs with differing node attributes should yield different graph hashes if the 'node_attr' and 'edge_attr' argument is supplied and populated in the graph, and there are no hash collisions. The output should still be invariant to node-relabeling rErFrGrrVrrWrorUrrXr cSrIrJrrLrrrr4r5z;test_isomorphic_edge_attr_and_node_attr..N)rr rNr<rYrrOr3r"rPr#rrMr[r\g1_hash_edge1_node1g1_hash_edge2_node2g1_hash_edge1_node2g1_hash_no_attrrg2_hash_edge1_node1g2_hash_edge2_node2rrr'test_isomorphic_edge_attr_and_node_attrsF        rcCsd\}}d|}td|dD]0}tj|||d|d}t|}tj|dd}||ks/Jt|dks7Jt|dks?Jqd S) d The hash string lengths should be as expected for a variety of graphs and digest sizes rErFrGr  digest_size@N)rr rNrlen)r3r"rPr#r?h16h32rrrtest_digest_sizes  rcstfdd|DS)z returns True if that each hash sequence in 'a' is a prefix for the corresponding sequence indexed by the same node in 'b'. c3s,|]\}}|dt||kVqdSNr)r2nodehashesr\rr s*z"is_subiteration..)allitems)r[r\rrris_subiterationsrcs.|dfddtfdd|DS)a returns True if all hex digest sizes are the expected length in a node:subgraph-hashes dictionary. Hex digest string length == 2 * bytes digest length since each pair of hex digits encodes 1 byte (https://docs.python.org/3/library/hashlib.html) recstfdd|DS)Nc3s|] }t|kVqdSrr)r2xhexdigest_sizerrrz...)r)lrrrr5z)hexdigest_sizes_correct..c3s|]}|VqdSrrr2r)list_digest_sizes_correctrrrsz*hexdigest_sizes_correct..)rvalues)r[rr)rrrhexdigest_sizes_corrects rcCst}t|}tj|dd}tj|dd}tj|dd}tj|dd}|iks+J|iks1J|iks7J|iks=J|iksCJdS) zZ " empty graphs should give empty dict subgraph hashes regardless of other params rrrrer rrN)r r!weisfeiler_lehman_subgraph_hashes)r?subgraph_hashes1subgraph_hashes2subgraph_hashes3subgraph_hashes4subgraph_hashes5rrrtest_empty_graph_subgraph_hashs     rcCr)z A directed graph with no bi-directional edges should yield different subgraph hashes to the same graph taken as undirected, if all hashes don't collide. r rrN)rr r r!r)r"r#r$r%directed_subgraph_hashesundirected_subgraph_hashesrrrtest_directed_subgraph_hash&r)rcCr*) z A directed graph with no bi-directional edges should yield different subgraph hashes to the same graph taken with edge directions reversed if there are no hash collisions. Here we test a cycle graph which is the minimal counterexample r+r,cSr.rr/r1rrrr4=r5z/test_reversed_subgraph_hash..r6r7rN)r r9r:r;r<r=rr>rrrtest_reversed_subgraph_hash6rDrcCsd\}}d|}td|dD]2}tj|||d|d}t|dd|D}t|}t|}|dd|DksAJqd S) z the subgraph hashes should be invariant to node-relabeling when the output is reindexed by the same mapping and all hashes don't collide. rErFrGrHrcSrIrJrrLrrrr4Pr5z1test_isomorphic_subgraph_hash..cSi|] \}}d||qSrJrr2kvrrrr4UsN)rr rNrOr<rr)r3r"rPr#rrg1_subgraph_hashesg2_subgraph_hashesrrrtest_isomorphic_subgraph_hashGs  rc Cs@d\}}d|}td|dD]}tj|||d|d}|jD] \}}|d|d|||d<|d|d |||d <q tj|dd }tj|d d }tj|d d } || ks\J|| ksbJ||kshJt|d d|D} tj| dd } tj| d d } |dd| DksJ|dd| DksJqd S)a Isomorphic graphs with differing edge attributes should yield different subgraph hashes if the 'edge_attr' argument is supplied and populated in the graph, and all hashes don't collide. The output should still be invariant to node-relabeling rErFrGrTrrUrVrrWrXrNcSrIrJrrLrrrr4tr5z;test_isomorphic_edge_attr_subgraph_hash..cSrrJrrrrrr4}cSrrJrrrrrr4r)rr rNrYrrOr<rrZrrr'test_isomorphic_edge_attr_subgraph_hashXs>    rcCrcrd)r rgrhrirjrkrrlrrr$test_missing_edge_attr_subgraph_hashs   rc Cs.d\}}d|}td|dD]}tj|||d|d}|D]}|d|j|d<|d|j|d <q!tj|dd }tj|d d }tj|d d }||ksSJ||ksYJ||ks_Jt|d d |D} tj| dd } tj| d d } |dd | DksJ|dd | DksJqd S)a Isomorphic graphs with differing node attributes should yield different subgraph hashes if the 'node_attr' argument is supplied and populated in the graph, and all hashes don't collide. The output should still be invariant to node-relabeling rErFrGrnrrVrrWrorNcSrIrJrrLrrrr4r5z;test_isomorphic_node_attr_subgraph_hash..cSrrJrrrrrr4rcSrrJrrrrrr4r)rr rNr<rrOrrprrr'test_isomorphic_node_attr_subgraph_hashs>     rcCrwrx)r rgrzrhrirjrkrrlrrr$test_missing_node_attr_subgraph_hashs   rcCsd\}}d|}td|dD]}tj|||d|d}|D]}|d|j|d<|d|j|d <q!|jD] \}}|d |d|||d <|d |d|||d <q;tj|d dd }tj|d d d } tj|d d d } t|} || ksJ| | ksJ|| ksJ| | ksJ| |ksJt|dd|D} tj| d dd } tj| d d d }|dd| DksJ| dd|DksJqdS)a Isomorphic graphs with differing node attributes should yield different subgraph hashes if the 'node_attr' and 'edge_attr' argument is supplied and populated in the graph, and all hashes don't collide The output should still be invariant to node-relabeling rErFrGr|rrVrrWrorUrrXr cSrIrJrrLrrrr4r5zItest_isomorphic_edge_attr_and_node_attr_subgraph_hash..cSrrJrrrrrr4rcSrrJrrrrrr4rN)rr rNr<rYrrOrr}rrr5test_isomorphic_edge_attr_and_node_attr_subgraph_hashsN        rcCsd\}}d|}td|dD]_}tj|||d|d}tj|dd}tj|dd}tj|d d}td d |Ds?Jtd d |DsLJtd d |DsYJt||s`Jt||sgJt||snJqdS)z All nodes should have the correct number of subgraph hashes in the output when using degree as initial node labels Subsequent iteration depths for the same graph should be additive for each node rErFrGiXrrfr ryr+cs|] }t|dkVqdSrfNrrrrrrrz'test_iteration_depth..csrryNrrrrrrrcsrr+NrrrrrrrN)rr rNrrrr)r3r"rPr#r?depth3depth4depth5rrrtest_iteration_depthsrc Csd\}}d|}td|dD]x}tj|||d|d}|jD]\}}|d|d|||d<q tj|dd d }tj|dd d }tj|dd d } td d|DsXJtdd|DseJtdd| DsrJt||syJt|| sJt|| sJqdS)a All nodes should have the correct number of subgraph hashes in the output when setting initial node labels empty and using an edge attribute when aggregating neighborhoods. Subsequent iteration depths for the same graph should be additive for each node rErFrGirrUrVrrf)rr ryr+csrrrrrrrr2rz1test_iteration_depth_edge_attr..csrrrrrrrr3rcsrrrrrrrr4rN)rr rNrYrrrr) r3r"rPr#r?r[r\rrrrrrtest_iteration_depth_edge_attrs,rc Cs d\}}d|}td|dD]s}tj|||d|d}|D] }|d|j|d<q!tj|ddd }tj|dd d }tj|dd d }td d |DsSJtdd |Ds`Jtdd |DsmJt||stJt||s{Jt||sJqdS)z All nodes should have the correct number of subgraph hashes in the output when setting initial node labels to an attribute. Subsequent iteration depths for the same graph should be additive for each node rErFrGi rrVrrf)rr ryr+csrrrrrrrrSrz1test_iteration_depth_node_attr..csrrrrrrrrTrcsrrrrrrrrUrN)rr rNr<rrrr) r3r"rPr#r?rMrrrrrrtest_iteration_depth_node_attr;s, rc Cs<d\}}d|}td|dD]}tj|||d|d}|D] }|d|j|d<q!|jD]\}}|d|d|||d <q1tj|d dd d }tj|d dd d } tj|d dd d } tdd|DslJtdd| DsyJtdd| DsJt|| sJt| | sJt|| sJqdS)a! All nodes should have the correct number of subgraph hashes in the output when setting initial node labels to an attribute and also using an edge attribute when aggregating neighborhoods. Subsequent iteration depths for the same graph should be additive for each node rErFrGirrVrrUrrf)rrr ryr+csrrrrrrrrxrz6test_iteration_depth_node_edge_attr..csrrrrrrrryrcsrrrrrrrrzrN) rr rNr<rYrrrr) r3r"rPr#r?rMr[r\rrrrrr#test_iteration_depth_node_edge_attr\s0 rcCsd\}}d|}td|dD].}tj|||d|d}t|}tj|dd}||ks/Jt|ds6Jt|ds=Jqd S) rrErFrGrrrrN)rr rNrr)r3r"rPr#r?digest_size16_hashesdigest_size32_hashesrrrtest_digest_size_subgraph_hashs  r)rinetworkxr networkx.generatorsrrr(rCrSrbrmrvr{rrrrrrrrrrrrrrrrrrrrrrs: ) ) 2 - - 6"! %