-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDijkstra_2.4_DRDN.py
346 lines (219 loc) · 8.11 KB
/
Dijkstra_2.4_DRDN.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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
# coding: utf-8
# In[65]:
"""
Samuel Oge 8/2/17
Dijkstra 2.0
Ran For Oroville Data
"""
import heapq
import pandas as pd
class PriorityQueue:
def __init__(self):
self.elements = []
def empty(self):
return len(self.elements) == 0
def put(self, item, priority):
heapq.heappush(self.elements, (priority, item))
def get(self):
return heapq.heappop(self.elements)[1]
nodesCSV = r'C:\Users\591943\Desktop\Python scripts\DOPEROAD_DOPENODE'
nodes = pd.read_csv(nodesCSV + r'.csv')
#nodes = pd.read_csv(r'..\Python scripts\DOPEROAD_DOPENODE.csv')
#roads = pd.read_csv(r'C:\Users\591943\Desktop\Python scripts\DOPEROAD_DOPENODE.csv')
unique_nodes= nodes.IN.unique()
a = list(nodes.IN)
b = list(nodes.OUT)
distance = list(roads.DISTANCE)
INF = ((1<<63) - 1)//2
def shortest_path(start, goal):
def graph():
#print(a)
#print('\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n')
#print(b)
#print('\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n')
#print(distance)
box=[]
for i,j in enumerate(a):
box.append([j,b[i],distance[i]])
case = {i:[] for i in a}
for i,v in enumerate(box):
if v[0]==a[i]:
case[a[i]].append(v[1:])
return case
graph_data = graph()
#print(s)
#h = (s[171])
#print(h)
def dijkstra_search(graph_data,start, goal):
#print(graph[173])
graph = graph_data
frontier = PriorityQueue()
frontier.put(start, 0)
came_from = { x:x for x in graph }
#print(came_from)
cost_so_far = { x: INF for x in graph }
#print(cost_so_far)
#cost_so_far = {}
cost_so_far[start] = 0
cost_so_far[goal] = INF
mileage = 0
while not frontier.empty():
if start == goal:
cost_so_far[goal] = 0
return (start, cost_so_far[goal] )
if start not in graph.keys():
#print('There is no path from %s, to %s' % (start,goal))
break
#print(frontier.elements)
current_node = frontier.get()
#print('Current Node:',current_node)
mileage += cost_so_far[current_node]
#print("Mileage:",mileage)
if current_node == goal or cost_so_far[goal]<mileage:
#print('GOAL CAME FROM: ',came_from[goal],', Goal Cost: ',cost_so_far[goal],', Dijkstra Mileage: ',mileage, sep= '')
#print('CURRENT NODDEEEEEEEEEE:',current_node)
break
for next_node in graph[current_node]:
try:
#print('GCN:',graph[current_node])
#print('Next node:',next_node)
n_id = next_node[0]
#if n_id not in graph.keys():
#print(not in)
#print('CURRENT COST:',cost_so_far[current_node])
#print('NEXT NODE COST:',cost_so_far[n_id])
#print('node id: ', n_id)
n_dist = next_node[1]
new_cost = cost_so_far[current_node] + n_dist
#if n_id not in cost_so_far or
if new_cost < cost_so_far[n_id]:
#print('new cost: ',new_cost)
cost_so_far[n_id] = new_cost
#print('cost so far',cost_so_far[n_id])
priority = new_cost
frontier.put(n_id, priority)
came_from[n_id] = current_node
if n_id == goal:
goal_miles = mileage
#print('GOAL MILEAGE:', goal_miles)
except:
if (n_id == goal and n_id not in graph.keys()):
#print('GOAL CAME FROM',came_from[current_node],mileage)
#print('CURRENT NODDEEEEEEEEEE:',current_node)
break
pass
if cost_so_far[goal] == INF:
#print(('There is no path from %s, to %s') % (start,goal))
return (0,INF)
else:
return (came_from, cost_so_far[goal])
#if dist[target]==INF:
# stdout.write("There is no path between " + source + " and " + target)
#print(cost_so_far)
#, cost_so_far
dijkstra_result = dijkstra_search(graph_data,start,goal)
def reconstruct_path(came_from, start, goal):
if came_from == 0:
return start
current_node = goal
path = [current_node]
while current_node != start:
current_node = came_from[current_node]
path.append(current_node)
#path.append(start) # optional
path.reverse() # optional
#print([goal])
return path
path_taken = reconstruct_path(dijkstra_result[0], start, goal)
return (path_taken, dijkstra_result[1])
#print(shortest_path(924,923))
#print(nodes[nodes['OUT'] == 924])
def find_all_shortest_paths(destination):
pathsDict = {k:[] for k in unique_nodes}
distDict = {l:[] for l in unique_nodes}
#dest = destination
for node in unique_nodes:
pack = {}
pack2 = {}
for dest in destination:
#print(dest, type(dest))
#result =dijkstra_search(s, node, destination)
#y =reconstruct_path(f, node, destination)
#y =print(shortest_path(node,dest)[0])
y = shortest_path(node,int(dest))[0]
pack[dest] = y
x=shortest_path(node,int(dest))[1]
pack2[dest]= x
pathsDict[node] = pack
distDict[node] = pack2
#for i in a:
#for v in pack:
#print(v)
#if v[0]==i:
#print('v:',v[0],'i:',i)
#pathsDict[i].append(v)
#print(pathDict[k])
return (pathsDict,distDict)
desti =input('Enter your destinations: ')
desti = list(desti.split(","))
for i, j in enumerate(desti):
desti[i]=(j.strip())
#print('Loading...')
#desti = [356, 924,194,491]
#print(desti, type(desti))
#print(dest, type(dest))
carton = find_all_shortest_paths(desti)
ALLTHEPATHS = carton[0] #{Node: {DEST{PATH}}}
ALLTHEDISTS = carton[1] #{Node: {DEST{DISTANCE}}}
min_dist = {i: min(ALLTHEDISTS[i].values()) for i in ALLTHEDISTS}
#print(di)
#print(ALLTHEDISTS)
#print(min_dist)
"""for key in ALLTHEDISTS.keys():
for dest, dist in ALLTHEDISTS[i].items():
#print('destination:',dest,'distance:',dist)
if min_dist[key] == dist:
print ('dest:',s,'v',v 'path:', ALLTHEPATHS[i].get(s))
"""
df = pd.DataFrame(columns=['NODE','DESTINATION','DISTANCE','PATH'])
for i in ALLTHEDISTS.keys():
for s,v in ALLTHEDISTS[i].items():
if min_dist[i] == v:
bestDest = s
if v == INF:
bestDest = 'None'
if bestDest == 'None':
bestPath = 'None'
else:
bestPath = ALLTHEPATHS[i].get(bestDest)
df.loc[len(df)]=[i,bestDest,min_dist[i],bestPath]
df
#nodes['GOAL_NODE'] = df.DESTINATION
#nodes['PATH_DISTANCE'] = df.DISTANCE
#nodes['DJK'] = df.PATH
#nodes.to_csv(nodesCSV+r'WithDJKandDistance.csv', index=False)""
#356, 66, 491, 924
# In[ ]:
for i in ALLTHEDISTS.keys():
for s,v in ALLTHEDISTS[i].items():
if min_dist[i] == v:
bestDest = s
if v == INF:
bestDest = 'None'
if bestDest == 'None':
bestPath = 'None'
else:
bestPath = ALLTHEPATHS[i].get(bestDest)
df.loc[len(df)]=[i,bestDest,min_dist[i],bestPath]
# In[ ]:
for i in ALLTHEDISTS.keys():
for s,v in ALLTHEDISTS[i].items():
#print('s:',s,'v:',v)
if min_dist[i] == v:
df.loc[len(df)]=[i,s,v,ALLTHEPATHS[i].get(s)]
# In[48]:
a =input('Enter your destinations: ')
a = int(a)
check = (a == 924)
print(check)
# In[ ]: