forked from fatemehsrz/Shortest_Distance
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgenerate_train_test.py
170 lines (103 loc) · 4.08 KB
/
generate_train_test.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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
import networkx as nx
from math import sqrt, log, log2, ceil
import random
import time
import numpy as np
def generate_pairs(graph_name='facebook.edges' ):
G=nx.read_edgelist("./data/%s.edges"%graph_name)
nodes= list(G.nodes())
edges= list(G.edges())
num_nodes= len(nodes)
num_edges= len(edges)
digit= int(ceil(log(num_nodes+1, 10)))
print(digit)
if digit<5:
k1=100
k2=11
else:
k1= 3
k2= 1
print('k1:',k1,'k2:',k2 )
k_node1=[]
################ selecting k nodes ###############
for i in range(k1):
n1=random.choice(nodes)
k_node1.append(n1)
############### remain nodes ##########################
remain_nodes= list(set(nodes)-set(k_node1))
print('number of all nodes:',num_nodes)
print('number of remaining nodes:',len(remain_nodes))
########################### train pairs ################
train_set=[]
y_train=[]
count=0
for a in k_node1:
for b in remain_nodes:
if nx.has_path(G, a, b):
sPath=nx.shortest_path(G, a, b)
length=1
for i in range(len(sPath)-1):
train_set.append((sPath[0],sPath[i+1], length) )
length+=1
count+=1
print('train:',count)
f4= open('./data/%s_train.txt'%(graph_name), 'w')
for i in range(len(train_set)):
if (6< train_set[i][2] <15):
f4.write(str(train_set[i][0])+' '+str(train_set[i][1])+' '+str(train_set[i][2]) )
f4.write('\n')
y_train.append(train_set[i][2])
f4.close()
print('training pairs:',len(y_train))
print('training max length:',max(y_train))
print('training min length:',min(y_train))
print('==========================00================================')
f1=open('./data/%s_statistics.txt'%(graph_name),'w')
f1.write('training pairs:'+str(len(y_train)))
f1.write('\n')
f1.write('training max length:'+str(max(y_train)))
f1.write('\n')
f1.write('training min length:'+str(min(y_train)))
f1.write('\n')
############################ test pairs #####################
test_set=[]
k_node2=[]
for i in range(k2):
n2=random.choice(remain_nodes)
k_node2.append(n2)
remain_nodes2= list(set(remain_nodes)-set(k_node2))
count=0
for s in k_node2:
for d in remain_nodes2:
if nx.has_path(G, s, d):
sPath=nx.shortest_path(G, s, d)
length=1
for i in range(len(sPath)-1):
#print(sPath[0],sPath[i+1], length)
test_set.append((sPath[0],sPath[i+1], length) )
length+=1
count+=1
print('test:',count)
X_test=[]
y_test=[]
f2= open('./data/%s_test.txt'%(graph_name), 'w')
for i in range(len(test_set)):
if (6< test_set[i][2] <15):
f2.write(str(test_set[i][0])+' '+ str(test_set[i][1]) +' '+ str(test_set[i][2]) )
f2.write('\n')
y_test.append(test_set[i][2])
f2.close()
print('number of test pairs:',len(y_test))
print('test max length:',max(y_test))
print('test min length:',min(y_test))
print('============================================================')
f1.write('number of test pairs:'+str(len(y_test)))
f1.write('\n')
f1.write('test max length:'+str(max(y_test)))
f1.write('\n')
f1.write( 'test min length:'+str(min(y_test)))
f1.write('\n')
f1.close()
graph_list=[ 'Facebook.edges', 'Youtube.edges'] # 'Facebook.edges' ,
for g in graph_list:
generate_pairs(g)