U td%&@s6d edddZd edddZd ddZd d ZdS)N_nx_name)vertex_attr_hashablecsVddl}|dkrDr.r&|jn|j}qHr<|jn|j}n|}fddD}|f|}t||j|jf}t j D]>\}} | } || d<|| kr| |} n|} |j | f| qt j D]\}} | } || d<|rd| kr| j d| d<|kr4j || j}j || j}n | j}| j}|j||f| q|S)aConverts the graph to networkx format. igraph has ordered vertices and edges, but networkx does not. To keep track of the original order, the '_igraph_index' vertex property is added to both vertices and edges. @param create_using: specifies which NetworkX graph class to use when constructing the graph. C{None} means to let igraph infer the most appropriate class based on whether the graph is directed and whether it has multi-edges. @param vertex_attr_hashable: vertex attribute used to name vertices in the exported network. The default "_nx_name" ensures round trip conversions to/from networkx are lossless. Ncsi|]}||qSr).0xgraphrL/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/igraph/io/libraries.py sz-_export_graph_to_networkx.. _igraph_index_nx_multiedge_keykey)networkxZ has_multiple is_directed MultiDiGraph MultiGraphZDiGraphGraph attributes isinstance enumeratevspopadd_nodeesvertex_attributessourcetargetadd_edge)rZ create_usingrnxclskwgZ multigraphivvattrZhashableedgeeattrZhashable_sourceZhashable_targetrrr _export_graph_to_networkxs8  r'cszddl}t|j}t|j}||i}t|}t|rdtt|jkrdd|j D ddt D}i} |j D]\} } || d| | <qnddt |D} ||| ||d } |j D]6\} } | D]$\} }| dkrq|| j| | | <qqd d |j D}d d|D}gt||j|jfrg|d <|jj ddD]R\}} }}| || | f|D]}||||q|d |qZnN|j D]B\}} }| || | f|D]}||||qސqd|krjddt |dD}|j ddddd|D|d=fddDfdd| D}| || S)aConverts the graph from networkx Vertex names will be stored as a vertex_attr_hashable attribute (usually "_nx_name", but see below). Because igraph stored vertices in an ordered manner, vertices will get new IDs from 0 up. In case of multigraphs, each edge will have an "_nx_multiedge_key" attribute, to distinguish edges that connect the same two vertices. @param g: networkx Graph or DiGraph @param vertex_attr_hashable: attribute used to store the Python hashable used by networkx to identify each vertex. The default value '_nx_name' ensures lossless round trip conversions to/from networkx. An alternative choice is 'name': in that case, using strings for vertex names is recommended and, if the graph is re-exported to networkx, Graph.to_networkx(vertex_attr_hashable="name") must be used to recover the correct vertex nomenclature in the exported network. rNr cSsg|]\}}|dqS)r r)rr#rrrr gsz2_construct_graph_from_networkx..cSsi|]\}}||qSrrrr"rrrr r isz2_construct_graph_from_networkx..cSsi|]\}}||qSrr)rr"r#rrr r os)ndirected graph_attrsZ vertex_attrscSs h|]\}}}|D]}|qqSrr)r_datanamerrr sz1_construct_graph_from_networkx..cSsi|] }|gqSrrrr/rrr r sr T)keyscSsg|]\}}||fqSrrr)rrr r(scSs|dS)Nr)rrrr z0_construct_graph_from_networkx..)r cSsg|] \}}|qSrrr)rrr r(scsg|] }|qSrrrr")edgesrr r(scs$i|]\}|fddDqS)csg|] }|qSrrr6valrr r(sz=_construct_graph_from_networkx...r)rr )idxr8r r s)rdictrlistZnodeslennextitervaluesr.sortrritemsrr7rrrappendget add_edges)rr!rrgattrZvnamesr$vcountZidx_dictZvdr#Zdatumrr r9 eattr_namesr&uZedgekeyr.r/Zsortdr)r7r:r _construct_graph_from_networkxGs^    rJcCsLddl}|j|d}|}|||dk rj|D].\}}|t|} | |j|<|||j|<q:|dk r|D]H\}}| t||j |<t |D]"} |j | ||j || | <qqz|dk r|D]\}}|t||j|<q|jD]N} || j| j} |dk r|D](\}}| |d} | |j|| <qq|S)aConverts the graph to graph-tool Data types: graph-tool only accepts specific data types. See the following web page for a list: https://graph-tool.skewed.de/static/doc/quickstart.html Note: because of the restricted data types in graph-tool, vertex and edge attributes require to be type-consistent across all vertices or edges. If you set the property for only some vertices/edges, the other will be tagged as None in igraph, so they can only be converted to graph-tool with the type 'object' and any other conversion will fail. @param graph_attributes: dictionary of graph attributes to transfer. Keys are attributes from the graph, values are data types (see below). C{None} means no graph attributes are transferred. @param vertex_attributes: dictionary of vertex attributes to transfer. Keys are attributes from the vertices, values are data types (see below). C{None} means no vertex attributes are transferred. @param edge_attributes: dictionary of edge attributes to transfer. Keys are attributes from the edges, values are data types (see below). C{None} means no vertex attributes are transferred. rN)r+)Z graph_toolrrrGZ add_vertexrBZnew_graph_propertystrgraph_propertiesZnew_vertex_propertyvertex_propertiesrangerZvertexZnew_edge_propertyedge_propertiesrrrrrrD)rZgraph_attributesrZedge_attributesgtr!vcrZdtypeZgpropr"r%eproprrr _export_graph_to_graph_tools0   " rTcCst|j}|}||||d}|jD]0\}}|}t|D]}|||j||<qFq.g} t |j } dd| D} | D]H} | t | t | f|j D]\} }| |  || qq|| | |S)zGConverts the graph from graph-tool @param g: graph-tool Graph )r*r+r,cSsi|] }|gqSrrr1rrr r sz4_construct_graph_from_graph_tool..)r;rLZ num_verticesrrMrBZ get_arrayrNrr<rOr7rCintrrrE)rr!rFrGrr r9rSr"r7rHr&rRr/Zattr_maprrr _construct_graph_from_graph_tools      rV)Nr)r)NNN)rKr'rJrTrVrrrr s F` C