ó ú£Õ\c@sŒdZddlZddlmZdjdddgƒZdd d d gZd „ZeZ d „Z e Z d„Z e Z ddd„ZdS(s Graph isomorphism functions. iÿÿÿÿN(t NetworkXErrors sAric Hagberg (hagberg@lanl.gov)sPieter Swart (swart@lanl.gov)s-Christopher Ellison cellison@cse.ucdavis.edu)tcould_be_isomorphictfast_could_be_isomorphictfaster_could_be_isomorphict is_isomorphicc Csô|jƒ|jƒkrtS|jƒ}tj|ƒ}tj|ƒ}g|D]!}||||||g^qM}|jƒ|jƒ}tj|ƒ}tj|ƒ} g|D]!}||||| |g^q¯} | jƒ|| krðtStS(s.Returns False if graphs are definitely not isomorphic. True does NOT guarantee isomorphism. Parameters ---------- G1, G2 : graphs The two graphs G1 and G2 must be the same type. Notes ----- Checks for matching degree, triangle, and number of cliques sequences. (tordertFalsetdegreetnxt trianglestnumber_of_cliquestsorttTrue( tG1tG2td1tt1tc1tvtprops1td2tt2tc2tprops2((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/isomorphism/isomorph.pyRs .  .  c CsÈ|jƒ|jƒkrtS|jƒ}tj|ƒ}g|D]}||||g^q>}|jƒ|jƒ}tj|ƒ}g|D]}||||g^qŠ}|jƒ||krÄtStS(sReturns False if graphs are definitely not isomorphic. True does NOT guarantee isomorphism. Parameters ---------- G1, G2 : graphs The two graphs G1 and G2 must be the same type. Notes ----- Checks for matching degree and triangle sequences. (RRRRR R R ( R RRRRRRRR((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/isomorphism/isomorph.pyR:s '  '  cCst|jƒ|jƒkrtSt|jƒjƒƒ}|jƒt|jƒjƒƒ}|jƒ||krptStS(sReturns False if graphs are definitely not isomorphic. True does NOT guarantee isomorphism. Parameters ---------- G1, G2 : graphs The two graphs G1 and G2 must be the same type. Notes ----- Checks for matching degree sequences. (RRtlistRtvaluesR R (R RRR((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/isomorphism/isomorph.pyR]s   cCs‡|jƒr*|jƒr*tjjj}n8|jƒ rV|jƒ rVtjjj}n tdƒ‚|||d|d|ƒ}|jƒS(sÓ Returns True if the graphs G1 and G2 are isomorphic and False otherwise. Parameters ---------- G1, G2: graphs The two graphs G1 and G2 must be the same type. node_match : callable A function that returns True if node n1 in G1 and n2 in G2 should be considered equal during the isomorphism test. If node_match is not specified then node attributes are not considered. The function will be called like node_match(G1.node[n1], G2.node[n2]). That is, the function will receive the node attribute dictionaries for n1 and n2 as inputs. edge_match : callable A function that returns True if the edge attribute dictionary for the pair of nodes (u1, v1) in G1 and (u2, v2) in G2 should be considered equal during the isomorphism test. If edge_match is not specified then edge attributes are not considered. The function will be called like edge_match(G1[u1][v1], G2[u2][v2]). That is, the function will receive the edge attribute dictionaries of the edges under consideration. Notes ----- Uses the vf2 algorithm [1]_. Examples -------- >>> import networkx.algorithms.isomorphism as iso For digraphs G1 and G2, using 'weight' edge attribute (default: 1) >>> G1 = nx.DiGraph() >>> G2 = nx.DiGraph() >>> G1.add_path([1,2,3,4],weight=1) >>> G2.add_path([10,20,30,40],weight=2) >>> em = iso.numerical_edge_match('weight', 1) >>> nx.is_isomorphic(G1, G2) # no weights considered True >>> nx.is_isomorphic(G1, G2, edge_match=em) # match weights False For multidigraphs G1 and G2, using 'fill' node attribute (default: '') >>> G1 = nx.MultiDiGraph() >>> G2 = nx.MultiDiGraph() >>> G1.add_nodes_from([1,2,3],fill='red') >>> G2.add_nodes_from([10,20,30,40],fill='red') >>> G1.add_path([1,2,3,4],weight=3, linewidth=2.5) >>> G2.add_path([10,20,30,40],weight=3) >>> nm = iso.categorical_node_match('fill', 'red') >>> nx.is_isomorphic(G1, G2, node_match=nm) True For multidigraphs G1 and G2, using 'weight' edge attribute (default: 7) >>> G1.add_edge(1,2, weight=7) >>> G2.add_edge(10,20) >>> em = iso.numerical_multiedge_match('weight', 7, rtol=1e-6) >>> nx.is_isomorphic(G1, G2, edge_match=em) True For multigraphs G1 and G2, using 'weight' and 'linewidth' edge attributes with default values 7 and 2.5. Also using 'fill' node attribute with default value 'red'. >>> em = iso.numerical_multiedge_match(['weight', 'linewidth'], [7, 2.5]) >>> nm = iso.categorical_node_match('fill', 'red') >>> nx.is_isomorphic(G1, G2, edge_match=em, node_match=nm) True See Also -------- numerical_node_match, numerical_edge_match, numerical_multiedge_match categorical_node_match, categorical_edge_match, categorical_multiedge_match References ---------- .. [1] L. P. Cordella, P. Foggia, C. Sansone, M. Vento, "An Improved Algorithm for Matching Large Graphs", 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, Cuen, pp. 149-159, 2001. http://amalfi.dis.unina.it/graph/db/papers/vf-algorithm.pdf s*Graphs G1 and G2 are not of the same type.t node_matcht edge_match(t is_directedRt algorithmst isomorphismtDiGraphMatchert GraphMatcherRR(R RRRtGMtgm((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/isomorphism/isomorph.pyR{s_ (t__doc__tnetworkxRtnetworkx.exceptionRtjoint __author__t__all__Rtgraph_could_be_isomorphicRtfast_graph_could_be_isomorphicRt faster_graph_could_be_isomorphictNoneR(((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/isomorphism/isomorph.pyts      $ !