(A)
| 143 | |
| 144 | |
| 145 | def normalize_digraph(A): |
| 146 | Dl = np.sum(A, 0) |
| 147 | num_node = A.shape[0] |
| 148 | Dn = np.zeros((num_node, num_node)) |
| 149 | for i in range(num_node): |
| 150 | if Dl[i] > 0: |
| 151 | Dn[i, i] = Dl[i]**(-1) |
| 152 | AD = np.dot(A, Dn) |
| 153 | return AD |
| 154 | |
| 155 | |
| 156 | def normalize_undigraph(A): |