U td@@sfddlmZmZmZmZddlmZdZedddfddZddd Z dd d Z dddZ dddZ dS))GET_ADJACENCY_BOTHGET_ADJACENCY_LOWERGET_ADJACENCY_UPPER GraphBase)Matrix)_get_adjacency_get_adjacency_sparse _get_adjlist_get_incidence _get_inclistNFc st|tkr.|tkr.|tkr.||}}|dkr.t}|rPtt||}|d8}|S|dkrhtt|S|jkr~tdfddt  D} rʈjD]}||||j |j <qt|S|tkr jD].}|j\}} ||||| <|||| |<qn`|tkrBjD]"}|||t|jt|j<qn*jD]"}|||t|jt|j<qHt|S)aReturns the adjacency matrix of a graph. @param type: either C{GET_ADJACENCY_LOWER} (uses the lower triangle of the matrix) or C{GET_ADJACENCY_UPPER} (uses the upper triangle) or C{GET_ADJACENCY_BOTH} (uses both parts). Ignored for directed graphs. @param attribute: if C{None}, returns the ordinary adjacency matrix. When the name of a valid edge attribute is given here, the matrix returned will contain the default value at the places where there is no edge or the value of the given attribute where there is an edge. Multiple edges are not supported, the value written in the matrix in this case will be unpredictable. This parameter is ignored if I{eids} is C{True} @param default: the default value written to the cells in the case of adjacency matrices with attributes. @param eids: specifies whether the edge IDs should be returned in the adjacency matrix. Since zero is a valid edge ID, the cells in the matrix that correspond to unconnected vertex pairs will contain -1 instead of 0 if I{eids} is C{True}. If I{eids} is C{False}, the number of edges will be returned in the matrix for each vertex pair. @return: the adjacency matrix as a L{Matrix}. NAttribute does not existcsg|]}gqS)vcount).0_defaultselfrI/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/igraph/adjacency.py Csz"_get_adjacency..)rrrrrZ get_adjacencyesattribute_names ValueErrorranger is_directedsourcetargettupleminmax) rtype attributerZeidsresultdataedgerrrrrrsB       "  rcCszddlm}Wntk r,tdYnX|}|dkrNdgt|}n ||jkrdtd|j|}|}|j |t t |f||fd}| s|| |dj||dj}|S) aReturns the adjacency matrix of a graph as a SciPy CSR matrix. @param attribute: if C{None}, returns the ordinary adjacency matrix. When the name of a valid edge attribute is given here, the matrix returned will contain the default value at the places where there is no edge or the value of the given attribute where there is an edge. @return: the adjacency matrix as a C{scipy.sparse.csr_matrix}. r)sparsez6You should install scipy in order to use this functionNr r )shape)Zscipyr& ImportErrorZ get_edgelistlenrrrrZ csr_matrixlistziprZtriuTZtril)rr"r&edgesweightsNZmtxrrrrYs   routcsfddtDS)aReturns the adjacency list representation of the graph. The adjacency list representation is a list of lists. Each item of the outer list belongs to a single vertex of the graph. The inner list contains the neighbors of the given vertex. @param mode: if C{"out"}, returns the successors of the vertex. If C{"in"}, returns the predecessors of the vertex. If C{"all""}, both the predecessors and the successors will be returned. Ignored for undirected graphs. csg|]}|qSr)Z neighborsridxmoderrrrsz _get_adjlist..rr)rr5rr4rr ys r r!cOs$ddlm}t||j|f||S)ayReturns the incidence matrix of a bipartite graph. The incidence matrix is an M{n} times M{m} matrix, where M{n} and M{m} are the number of vertices in the two vertex classes. @param types: an igraph vector containing the vertex types, or an attribute name. Anything that evalulates to C{False} corresponds to vertices of the first kind, everything else to the second kind. @return: the incidence matrix and two lists in a triplet. The first list defines the mapping between row indices of the matrix and the original vertex IDs. The second list is the same for the column indices. r)Graph)Zigraphr7superZ get_incidence)graphtypesargskwdsr7rrrr s r csfddtDS)aReturns the incidence list representation of the graph. The incidence list representation is a list of lists. Each item of the outer list belongs to a single vertex of the graph. The inner list contains the IDs of the incident edges of the given vertex. @param mode: if C{"out"}, returns the successors of the vertex. If C{"in"}, returns the predecessors of the vertex. If C{"all"}, both the predecessors and the successors will be returned. Ignored for undirected graphs. csg|]}|qSr)Zincidentr2r9r5rrrsz _get_inclist..r6r=rr=rr s r )N)r1)r!)r1) Zigraph._igraphrrrrZigraph.datatypesr__all__rrr r r rrrrs   F