Create adjacency matrix and degree sequence.
(E, n, undir=True)
| 131 | |
| 132 | |
| 133 | def createA(E, n, undir=True): |
| 134 | """Create adjacency matrix and degree sequence.""" |
| 135 | if undir: |
| 136 | G = eg.Graph() |
| 137 | else: |
| 138 | G = eg.DiGraph() |
| 139 | G.add_nodes_from(range(n)) |
| 140 | |
| 141 | for e in E: |
| 142 | G.add_edge(e[0], e[1]) |
| 143 | |
| 144 | A = eg.to_scipy_sparse_matrix(G) |
| 145 | |
| 146 | degree = np.array(A.sum(1)).flatten() |
| 147 | |
| 148 | return A, degree |
| 149 | |
| 150 | |
| 151 | def calculateRWRrange(W, i, alphas, n, maxIter=1000): |
no test coverage detected