-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathaddon functions.py
70 lines (63 loc) · 2.1 KB
/
addon functions.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
# -*- coding: utf-8 -*-
"""
Created on Sun Jul 31 21:56:56 2016
@author: rghuang
"""
def mixing_matrix(graph, membership, weights=None):
import numpy as np
k = len(np.unique(graph.vs[membership]))
result = np.matrix([[0]* k for _ in range(k)])
member = graph.vs[membership]
mapping = dict(zip(np.unique(member), range(len(np.unique(member)))))
print("Mapping rule: ", mapping)
member = np.vectorize(mapping.get)(member)
graph = graph.copy()
graph.vs[membership] = member
for edge in graph.es:
ms, mt = graph.vs[edge.source][membership], graph.vs[edge.target][membership]
if weights is None:
result[ms, mt] += 1
else:
result[ms, mt] += edge[weights]
return result
def mixing_df(graph, membership, weights=None):
"""
Same as mixing_matrix, but return the result in a pd.DataFrame
"""
import numpy as np
import pandas as pd
k = len(np.unique(graph.vs[membership]))
klevels = np.unique(graph.vs[membership])
result = pd.DataFrame(np.matrix([[0]* k for _ in range(k)]),
index=klevels, columns=klevels)
for edge in graph.es:
ms, mt = graph.vs[edge.source][membership], graph.vs[edge.target][membership]
if weights is None:
result.loc[ms, mt] += 1
else:
result.loc[ms, mt] += edge[weights]
return result
def linmap(x, max_value, min_value):
"""
Linear mapping of x into [min_value, max_value]
"""
a = min(x)
b = max(x)
ans = [(max_value - min_value) * (el - a) / (b - a) + min_value for el in x]
return ans
def changeAlpha(color, alpha=0.5):
"""
@color: rgb color
"""
return color[:3] + (alpha,)
def get_coords(g0, g1):
"""
Keep the coordinates of graph g0 after certain nodes are deleted.
G0: original graph
G1: derived graph from G0 after certain nodes are deleted.
"""
import igraph
coords0 = g0['layout'].coords
coords0 = dict([el for el in zip(g0.vs['name'], coords0)])
coords1 = [coords0.get(v) for v in g1.vs['name']]
return igraph.Layout(coords1)