-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbpm.py
231 lines (185 loc) · 5.52 KB
/
bpm.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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
import networkx as nx
from networkx.algorithms import bipartite
import random
import time
def test1():
B = nx.Graph()
B.add_nodes_from([1,2,3,4,5,6,7,8,9,10], bipartite=0) # Add the node attribute "bipartite"
B.add_nodes_from(['a','b','c','d','e','f','g'], bipartite=1)
B.add_edge(1, 'a', weight = 10)
B.add_edge(1, 'b', weight = 5)
B.add_edge(1, 'c', weight = 1)
B.add_edge(2, 'a', weight = 1)
B.add_edge(2, 'b', weight = 10)
B.add_edge(3, 'a', weight = 5)
B.add_edge(4, 'b', weight = 1)
B.add_edge(5, 'c', weight = 5)
B.add_edge(6, 'c', weight = 1)
B.add_edge(6, 'd', weight = 5)
B.add_edge(6, 'e', weight = 10)
B.add_edge(7, 'd', weight = 1)
B.add_edge(7, 'e', weight = 5)
B.add_edge(8, 'f', weight = 5)
B.add_edge(9, 'f', weight = 10)
B.add_edge(10, 'e', weight = 10)
B.add_edge(10, 'f', weight = 1)
B.add_edge(10, 'g', weight = 5)
#B.add_edges_from([(1,'a'), (1,'b'), ((2,'b'), (2,'c'), (3,'c'), (4,'a')])
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
return res
def test2():
B = nx.Graph()
B.add_nodes_from([1,2,3], bipartite=0) # Add the node attribute "bipartite"
B.add_nodes_from([5, 6], bipartite=1)
B.add_edge(1, 5, weight = 3)
B.add_edge(1, 6, weight = 99)
B.add_edge(2, 6, weight = 1)
B.add_edge(3, 6, weight = 2)
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
return res
def test2b():
B = nx.Graph()
B.add_nodes_from([1,2,3], bipartite=0) # Add the node attribute "bipartite"
B.add_nodes_from([5, 6], bipartite=1)
B.add_edge(1, 5, weight = 3)
B.add_edge(1, 6, weight = 4)
B.add_edge(2, 6, weight = 1)
B.add_edge(3, 6, weight = 2)
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
return res
def test3():
B = nx.Graph()
B.add_nodes_from([1,2,3,4,5,6,7], bipartite=0)
B.add_nodes_from(['a','b','c','d','e'], bipartite=1)
B.add_edge(1, 'a', weight = 1)
B.add_edge(2, 'a', weight = 2)
B.add_edge(2, 'b', weight = 3)
B.add_edge(3, 'b' ,weight = 1)
B.add_edge(4, 'b', weight = 2)
B.add_edge(4, 'c', weight = 3)
B.add_edge(5, 'c', weight = 1)
B.add_edge(5, 'd', weight = 2)
B.add_edge(6, 'd', weight = 3)
B.add_edge(6, 'e', weight = 1)
B.add_edge(7, 'd', weight = 2)
B.add_edge(8, 'e', weight = 3)
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
return res
def test4():
B = nx.Graph()
B.add_nodes_from([1,2,3,4,5,6,7], bipartite=0)
B.add_nodes_from(['a','b','c','d','e'], bipartite=1)
B.add_edge(1, 'a', weight = 6)
B.add_edge(2, 'a', weight = 2)
B.add_edge(2, 'b', weight = 4)
B.add_edge(3, 'b' ,weight = 6)
B.add_edge(4, 'b', weight = 2)
B.add_edge(4, 'c', weight = 4)
B.add_edge(5, 'c', weight = 6)
B.add_edge(5, 'd', weight = 2)
B.add_edge(6, 'd', weight = 4)
B.add_edge(6, 'e', weight = 6)
B.add_edge(7, 'd', weight = 2)
B.add_edge(8, 'e', weight = 4)
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
return res
def test5():
start = time.time()
B = nx.Graph()
B.add_nodes_from([i for i in range(1000)], bipartite=0)
B.add_nodes_from([i for i in range(1000, 20000)], bipartite=1)
for i in range(1000):
for r in range(1000, 2000):
if i == (r-1000):
B.add_edge(i, r, weight = 100)
else:
B.add_edge(i, r, weight = random.randint(95, 99) )
print "made it here"
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
end = time.time()
print(end-start)
return res
def test6():
#test2 on a larger scale
start = time.time()
B = nx.Graph()
B.add_nodes_from([i for i in range(999)], bipartite=0)
B.add_nodes_from([i for i in range(999, 1665)], bipartite=1)
i = 0
r = 999
while(i<998):
B.add_edge(i, r, weight = 3)
B.add_edge(i, r+1, weight = 100)
B.add_edge(i+1, r+1, weight = 1)
B.add_edge(i+2, r+1, weight = 2)
i+=3
r+=2
print "made it here"
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
end = time.time()
print(end-start)
return res
def test7():
#2b on larger scale
#test2 on a larger scale
start = time.time()
B = nx.Graph()
B.add_nodes_from([i for i in range(999)], bipartite=0)
B.add_nodes_from([i for i in range(999, 1665)], bipartite=1)
i = 0
r = 999
while(i<998):
B.add_edge(i, r, weight = 3)
B.add_edge(i, r+1, weight = 4)
B.add_edge(i+1, r+1, weight = 1)
B.add_edge(i+2, r+1, weight = 2)
i+=3
r+=2
print "made it here"
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
end = time.time()
print(end-start)
return res
def test8():
#2b on larger scale
#test2 on a larger scale
start = time.time()
B = nx.Graph()
B.add_nodes_from([i for i in range(999)], bipartite=0)
B.add_nodes_from([i for i in range(999, 1665)], bipartite=1)
i = 0
r = 999
while(i<998):
B.add_edge(i, r, weight = 3)
B.add_edge(i+1, r, weight = 3)
B.add_edge(i+2, r, weight = 3)
B.add_edge(i+1, r+1, weight = 1)
B.add_edge(i+2, r+1, weight = 2)
i+=2
r+=2
print "made it here"
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
end = time.time()
print(end-start)
return res
def test9():
#Alternation on test8
start = time.time()
B = nx.Graph()
B.add_nodes_from([i for i in range(999)], bipartite=0)
B.add_nodes_from([i for i in range(999, 1665)], bipartite=1)
i = 0
r = 999
while(i<998):
B.add_edge(i, r, weight = 4)
B.add_edge(i+1, r, weight = 3)
B.add_edge(i+2, r, weight = 3)
B.add_edge(i+1, r+1, weight = 2)
B.add_edge(i+2, r+1, weight = 1)
i+=2
r+=2
print "made it here"
res = nx.algorithms.matching.max_weight_matching(B, maxcardinality=False)
end = time.time()
print(end-start)
return res