U tdF@sXdZdZdZddlmZmZmZmZddlm Z ddZ dd Z dd d Z dddZ dS)zCImplementation of union, disjoint union and intersection operators.)disjoint_unionunion intersectionz google en) GraphBase_union _intersection_disjoint_union)warncCs$t|}t|t|kr td|S)aConverts a list of names to a set of names while checking for duplicates. Parameters: names: the list of names to convert Returns: the set of unique names appearing in the list Raises: RuntimeError: if the input name list has duplicates z%Graph contains duplicate vertex names)setlenAttributeError)namesZnamesetrS/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/igraph/operators/functions.pyname_set s rcCstdd|Drtdt|}|dkr2td|dkrF|dSt|}i}t}t|dD]\}}|D]|}||}||kr|||<|||<qr|||krqr||kr| |||} |||d || <||=||d ||<qrqbd} |D]@}| } | D]"} |j | |j | | | | <q| | 7} qd} |D]B}|} |D]"} |j| |j| | | | <qX| | 7} qD|S)aCGraph disjoint union. The disjoint union of two or more graphs is created. This function keeps the attributes of all graphs. All graph, vertex and edge attributes are copied to the result. If an attribute is present in multiple graphs and would result a name clash, then this attribute is renamed by adding suffixes: _1, _2, etc. An error is generated if some input graphs are directed and others are undirected. Parameters: graphs: list of graphs. A lazy sequence is not acceptable. Returns: the disjoint union graph css|]}t|t VqdSN isinstancer.0grrr 1sz!disjoint_union..Not all elements are graphsrz)disjoint_union() needs at least one graph{:}_{:})any TypeErrorr ValueErrorcopyrr enumerate attributesaddformatvcountvertex_attributesvsecountedge_attributeses)graphsngr graph_union a_first_graph a_conflictigra_namea_valueigfinvattrnerrrrsL           rautoc stdd|Drtd|dkr*tdt|}tdd|D}|dkr|||k}|d|fkrtd |d ||d n&|r||krtd |d ||d |dkrtd|dkr|dS|rzdd|D}tt j dd|D}ddt |Dt|}g}t ||D]\\}} |} tt |t | } | | fdd| jdD} | | } || qn|}tdd|D} t|| }| r|d}|d} n|}i}t }t |dD]\}}|D]}||}||kr|||<|||<q|||krq||krP||||}|||d||<||=||d||<qڐq|rx||jd<t j dd|Dt dg}|}|D]}d}ddt|D}|D]z}||kr,t |j|D]J\}}|dkrq||dkr|||<q|||krd}q,q|rq<q|sP||j|<qt |dD]0\}}||krZ|j||jd||<qZq| rt j d d|D}|}|D]V}d}d!dt|D}t || D]\}}||krqt ||j|D]f\}}|dkrq||dkr6|||<q|||krt||jd|||||d}qnq|rq~q|s||j|<qt t || dD]h\}\}}||krqd"dt|D}t ||j|D]\}}|||<q||jd||<qq|S)#aGraph union. The union of two or more graphs is created. The graphs may have identical or overlapping vertex sets. Edges which are included in at least one graph will be part of the new graph. This function keeps the attributes of all graphs. All graph, vertex and edge attributes are copied to the result. If an attribute is present in multiple graphs and would result a name clash, then this attribute is renamed by adding suffixes: _1, _2, etc. The ``name`` vertex attribute is treated specially if the operation is performed based on symbolic vertex names. In this case ``name`` must be present in all graphs, and it is not renamed in the result graph. An error is generated if some input graphs are directed and others are undirected. Parameters: graphs: list of graphs. A lazy sequence is not acceptable. byname: bool or 'auto' specifying the function behaviour with respect to names vertices (i.e. vertices with the 'name' attribute). If False, ignore vertex names. If True, merge vertices based on names. If 'auto', use True if all graphs have named vertices and False otherwise (in the latter case, a warning is generated too). Returns: the union graph Raises: RuntimeError: if 'byname' is set to True and some graphs are not named or the set of names is not unique in one of the graphs css|]}t|t VqdSrrrrrrrszunion..rTFr6#"byname" should be a bool or "auto"css|]}|VqdSrZis_namedrrrrrsr6r(Some, but not all graphs are named (got  named, ! unnamed), not using vertex namesSome graphs are not named (got unnamed)z union() needs at least one graphrcSsg|]}|jdqSnamer%rrrr szunion..css|]}t|VqdSrrrZvnsrrrrscSsi|]\}}||qSrrrr2xrrr szunion..csg|] }|qSrrrrFZpermutation_maprrrBsr@css|]}t|VqdSrr r'rrrrrsgraphedgemapsrcss|]}t|VqdSrr r$rrrrrsFcSsg|]}dqSrrrr2rrrrBsNTcss|]}t|VqdSrr r'rrrrrscSsg|]}dqSrrrNrrrrBscSsg|]}dqSrrrNrrrrB!s)rrrr sumr RuntimeErrorrlistr rrzip add_verticesr%permute_verticesappendrr r!r"r#ranger$r&r'r(print)r)bynamer*n_namedallnamesuninamesZnve newgraphsr vertex_namesng v_missing permutationrLresr+r,r-r.r/r0r1attrsconflictvalsr2r5emapiurrIrris#                      rTcs\tdd|Drtd|dkr*tdt|}tdd|D}|dkr|||k}|d|fkrtd |d ||d n&|r||krtd |d ||d |dkrtd|dkr|dS|rdd|D}|rtt j dd|D}ntt j dd|D}ddt |Dt|}g}t ||D]\} } | } |rntt |t | } | | ntt | t |} | | fdd| jdD}| |} || q8n|}tdd|D}t||}|r|d}|d}n|}i}t }t |dD]\}} | D]}| |}||krL|||<|||<q|||kr^q||kr||||}|||d||<||=||d||<qq|r||jd<t j dd|Dt dg}|}|D]}d}ddt|D}|D]~} || krqt | j|D]J\}}|dkr>q(||dkrX|||<q(|||kr(d }qtq(|rqq|s||j|<qt |dD]0\}} || kr| j||jd||<qq|rXt j d!d|D}|}|D]V}d}d"dt|D}t ||D]\} }|| kr>q$t || j|D]X\}}|d#krdqN|dkrrqN||dkr|||<qN|||krNd }qqN|r$qq$|s||j|<qt t ||dD]v\}\} }|| krqd$dt|D}t || j|D] \}}|d#kr2q|||<q||jd||<qܐq|S)%aJGraph intersection. The intersection of two or more graphs is created. The graphs may have identical or overlapping vertex sets. Edges which are included in all graphs will be part of the new graph. This function keeps the attributes of all graphs. All graph, vertex and edge attributes are copied to the result. If an attribute is present in multiple graphs and would result a name clash, then this attribute is renamed by adding suffixes: _1, _2, etc. The ``name`` vertex attribute is treated specially if the operation is performed based on symbolic vertex names. In this case ``name`` must be present in all graphs, and it is not renamed in the result graph. An error is generated if some input graphs are directed and others are undirected. Parameters: graphs: list of graphs. A lazy sequence is not acceptable. byname: bool or 'auto' specifying the function behaviour with respect to names vertices (i.e. vertices with the 'name' attribute). If False, ignore vertex names. If True, merge vertices based on names. If 'auto', use True if all graphs have named vertices and False otherwise (in the latter case, a warning is generated too). keep_all_vertices: bool specifying if vertices that are not present in all graphs should be kept in the intersection. Returns: the intersection graph Raises: RuntimeError: if 'byname' is set to True and some graphs are not named or the set of names is not unique in one of the graphs css|]}t|t VqdSrrrrrrrNszintersection..rr7r8css|]}|VqdSrr9rrrrrUsr6rr:r;r<r=r>z'intersection() needs at least one graphrcSsg|]}|jdqSr?rArrrrrBksz intersection..css|]}t|VqdSrrCrDrrrrnscss|]}t|VqdSrrCrDrrrrpscSsi|]\}}||qSrrrErrrrGqsz intersection..csg|] }|qSrrrHrIrrrBsr@css|]}t|VqdSrrJrrrrrsrKrLrcss|]}t|VqdSrrMrrrrrsFcSsg|]}dqSrrrNrrrrBsNTcss|]}t|VqdSrrOrrrrrscSsg|]}dqSrrrNrrrrBscSsg|]}dqSrrrNrrrrBs)rrrr rPr rQrrRr rrrrSrTZdelete_verticesr%rUrVrr r!r"r#rWr$r&r'r()r)rYZkeep_all_verticesr*rZr[r\r3r]rr^r_r`Z v_privaterarLrbZ graph_intsecr,r-r.r/r0r1rcrdrer2r5rfrgrrIrr)s%                         rN)r6)r6T)__doc____all__ __docformat__Zigraph._igraphrrrrwarningsr rrrrrrrrs K A