-
Notifications
You must be signed in to change notification settings - Fork 0
/
reposition.py
51 lines (37 loc) · 1.29 KB
/
reposition.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
from dijkstra import *
from timeit import default_timer as timer
import random
import matplotlib.pyplot as plt
import networkx as nx
class repositionStrategy(dijkstra):
def __init__(self, G):
dijkstra.__init__(self, G)
self.name = "Reposition strategy"
def search(self, source, target):
G = self.graph.copy()
start = timer()
path = self.shortest_path(source, target)
route = []
route.append(path[0])
costRS = 0
costRUN = 0
i = 0
while route[-1] != target:
if self.graph.get_edge_data(path[i], path[i + 1])["color"] != "red":
route.append(path[i + 1])
costRS += self.graph.get_edge_data(path[i], path[i + 1])["weight"]
costRUN += self.graph.get_edge_data(path[i], path[i + 1])["weight"]
i += 1
else:
costRS += costRUN
costRUN = 0
self.graph.remove_edge(path[i], path[i + 1])
path = self.shortest_path(source, target)
i = 0
end = timer()
elapsed = end - start
print("Search time:", elapsed)
print("Path: ", route)
print("Path length:", costRS)
self.graph = G
return elapsed, costRS, route