'''

for each node,

add a new connection to random other node, with prob p_new_connection,

remove a connection, with prob p_remove_connection

operates on G in-place

'''

new_edges = []

rem_edges = []

#aux_degree = G.degree()

for node in G.nodes():

#print(node)

# find the other nodes this one is connected to

val_node_bp = list(G.node[node].values())[0]

if val_node_bp == bp:

connected = [to for (fr, to) in G.edges(node)]

#print(connected)

# and find the remainder of nodes, which are candidates for new edges

unconnected = [n for n in G.nodes() if not n in connected and val_node_bp != list(G.node[n].values())[0]]

k_degree = len(connected)

#print("\tdegree:\t {} -- {}".format(node, k_degree))

if len(connected):

for i in range(k_degree):

remove = connected[i]

G.remove_edge(node, remove)

#print("\tedge removed:\t {} -- {}".format(node, remove))

rem_edges.append( (node, remove) )

connected = []

if len(unconnected):

for i in range(k_degree):

new = random.choice(unconnected)

G.add_edge(node, new)

#print("\tnew edge:\t {} -- {}".format(node, new))

new_edges.append( (node, new) )

unconnected.remove(new)

connected.append(new)

degX,degY=bipartite.degrees(G,nodes_0)

degATC = dict(degX).values()

degCIE = dict(degY).values()

counterATC = collections.Counter(degATC)

counterCIE = collections.Counter(degCIE)

c_list = []

nc_list = []

nuc_list = []

if bp == 0:

for th in sorted(list(counterCIE.keys())):

#th = 1

H = nx.Graph()

#for v in G.nodes(data = True):

# if v[1]['bipartite'] == 0:

# H.add_node(v[0])

for n in G.nodes(data=True):

if n[1]['bipartite'] == 0:

sourceNode = n[0]

s_neighbors = set(G.neighbors(n[0]))

for m in G.nodes(data = True):

if m[1]['bipartite'] == 0: #### Change to 1 to change the projection to active ingredient

targetNode = m[0]

t_neighbors = set(G.neighbors(m[0]))

if sourceNode != targetNode:

if len(s_neighbors & t_neighbors) >= th:

H.add_node(sourceNode)

H.add_node(targetNode)

H.add_edge(sourceNode,targetNode)

components = sorted(nx.connected_components(H), key=len, reverse=True)

#sum(list(map(lambda c: len(c), components)))

c_list.append(len(components))

nodes_connected = sum(list(map(lambda c: len(c), components)))

nc_list.append(nodes_connected)

nuc_list.append(len(nodes_0) - nodes_connected)

#nx.write_graphml(H,'proCIE_th_'+str(th)+'.graphml')

else:

for th in sorted(list(counterATC.keys())):

#th = 136

H = nx.Graph()

#for v in G.nodes(data = True):

# if v[1]['bipartite'] == 1:

# H.add_node(v[0])

for n in G.nodes(data=True):

if n[1]['bipartite'] == 1:

sourceNode = n[0]

s_neighbors = set(G.neighbors(n[0]))

for m in G.nodes(data = True):

if m[1]['bipartite'] == 1: #### Change to 1 to change the projection to active ingredient

targetNode = m[0]

t_neighbors = set(G.neighbors(m[0]))

if sourceNode != targetNode:

if len(s_neighbors & t_neighbors) >= th:

#print(len(s_neighbors & t_neighbors))

#print(sourceNode + " " + targetNode)

H.add_node(sourceNode)

H.add_node(targetNode)

H.add_edge(sourceNode,targetNode)

components = sorted(nx.connected_components(H), key=len, reverse=True)

c_list.append(len(components))

nodes_connected = sum(list(map(lambda c: len(c), components)))

nc_list.append(nodes_connected)

nuc_list.append(len(nodes_1) - nodes_connected)

#nx.write_graphml(H,'proATC_th_'+str(th)+'.graphml')

#degXH,degYH=bipartite.degrees(H,nodes_0)

#degATCH = dict(degXH).values()

#degCIEH = dict(degYH).values()

#counterATCH = collections.Counter(degATCH)

#counterCIEH = collections.Counter(degCIEH)