import numpy as np import shed import matplotlib pyplot as plt from sc

  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
import numpy as np
import shed
import matplotlib.pyplot as plt
from scipy.spatial import Delaunay
import networkx as nx
from scipy.spatial import distance
from scipy.optimize import linprog
class path:
def __init__ (self,C,f):
self.C = C
self.flow = f
def getK (self,p):
d = 0
for i in range(len(self.C)-1):
d += distance.euclidean(p[self.C[i]],p[self.C[i+1]])
return d/distance.euclidean(p[self.C[0]],p[self.C[-1]])
def builtRandomTransit (n):
f = []
for i in range(n):
f.append([0] * n)
for i in range(n):
for j in range(n):
f[i][j]=np.random.randint(10)+1
if i==j:
f[i][j]=0
return f
def getMinFlow (C):
if len(C)==1:
return 0
min_flow = np.inf
for i in range(len(C)-1):
if G[C[i]][C[i+1]]['capacity']<min_flow:
min_flow = G[C[i]][C[i+1]]['capacity']
return min_flow
def getKPath (C,p):
d = 0
for i in range(len(C)-1):
d += distance.euclidean(p[C[i]],p[C[i+1]])
return d/distance.euclidean(p[C[0]],p[C[-1]])
def simplexNewPaths (G, old_paths,edge,points,capacity,V):
# G.remove_edge (edge[0],edge[1])
w = G[edge[0]][edge[1]]
G.remove_edge (edge[0],edge[1])
new_paths = []
k = []
for p in old_paths:
new_paths.append (nx.shortest_path(G,p[0],p[-1]))
k.append(getKPath(p,points))
# print ("Change paths",new_paths)
for p in new_paths:
k.append(getKPath(p,points))
size = len(old_paths)
A_e = []
A_u = [[]]
b_u = [capacity]
b_e = []
for i in range(size):
A_e.append([])
b_e.append(V[old_paths[i][0]][old_paths[i][-1]])
for j in range(size*2):
if j==2*i or j==2*i+1:
A_e[i].append(1)
else:
A_e[i].append(0)
for j in range(size*2):
if j%2==0:
A_u[0].append(1)
else:
A_u[0].append(0)
res = linprog(k, A_ub=A_u, b_ub=b_u, A_eq = A_e, b_eq=b_e,bounds=(0, None))
G.add_edge(edge[0],edge[1],w)
return new_paths, res.x
#Создание и отрисовка случайного графа при помощи триангуляции Делоне
N = 6
p = shed.builtPoints(N,10,10)
tri = Delaunay(p)
e,f = shed.getEdgesDelaunay(tri)
G = nx.DiGraph()
for edge in e:
G.add_edge(edge[0],edge[1],weight = round(distance.euclidean(p[edge[0]],p[edge[1]]),3), capacity = np.random.randint(50)+1,flow=[],problem = True)
positions_vertexes = [(p[i][0], p[i][1]) for i in range(N)]
edge_labels=dict([((u,v,),(d['capacity'])) for u,v,d in G.edges(data=True)])
nx.draw_networkx_edge_labels(G,positions_vertexes,edge_labels=edge_labels,label_pos=0.75)
nx.draw_networkx(G, positions_vertexes, with_labels=True, arrows=True, node_color='Red')
plt.show()
#Создание случайной матрциы перевозок
V = builtRandomTransit(N)
shed.pprint (V)
result_flows = [[[] for i in range(N)] for j in range(N)]
#Поиск всех кратчайших путей
path = nx.all_pairs_dijkstra_path(G)
print (path)
#for i, u in path.items():
# for j, v in u.items():
# path[i][j]=(path[i][j], getMinFlow(path[i][j]),getKPath(path[i][j],p))
for i in range(N):
for j in range(N):
result_flows[i][j] = (path[i][j],V[i][j])
for k in range(len(path[i][j])-1):
# G[path[i][j][k]][path[i][j][k+1]]['capacity'] -= V[i][j]
G[path[i][j][k]][path[i][j][k+1]]['flow'].append(path[i][j])
edge_labels=dict([((u,v,),(d['capacity'])) for u,v,d in G.edges(data=True)])
nx.draw_networkx_edge_labels(G,positions_vertexes,edge_labels=edge_labels,label_pos=0.75)
nx.draw_networkx(G, positions_vertexes, with_labels=True, arrows=True, node_color='Red')
plt.show()
#for i, u in path.items():
# for j, v in u.items():
# print (path[i][j], getMinFlow(path[i][j]), V[i][j])
for u,v,d in G.edges(data=True):
print (u,v,d['capacity'],d['flow'])
for u,v,d in G.edges(data=True):
sum_flow = sum([V[paths_edge[0]][paths_edge[-1]] for paths_edge in d['flow'] ])
if sum_flow>d['capacity']:
print (u,v,d['capacity'],sum_flow)
newPaths, flows = simplexNewPaths(G,d['flow'],(u,v),p, d['capacity'],V)
oldPaths = [i for i in d['flow']]
print (oldPaths, newPaths, flows)
size = len (newPaths)
for i in range(size):
if flows[i*2]==0:
for j in range(len(oldPaths[i])-1):
G[oldPaths[i][j]][oldPaths[i][j+1]]['flow'].remove(oldPaths[i])
if flows[i*2+1]!=0:
for j in range(len(newPaths[i])-1):
G[newPaths[i][j]][newPaths[i][j+1]]['flow'].append(newPaths[i])
for u,v,d in G.edges(data=True):
print (u,v,d['capacity'],d['flow'])