def __init__(self):
self.a = []
self.b = []
self.d = []
self.source = randint(0, N - 1)
(self.a, self.b, self.d) = graph_gen.gen(N, 10000)
dijkstra.INFI = 100000000
self.d_adapt = adapton_list.l2ll(self.d)
self.d_value = map(lambda x: Value.Value(x), self.d)
self.g = dijkstra.Dijkstra(N, self.a, self.b, self.d_adapt)
self.g_value = dijkstra.Dijkstra(N, self.a, self.b, self.d_value)
self.trace = self.g.compute_trace(self.source)
self.dis_adapt = self.g.distances_adap(self.source, self.trace)
self.dis_value = self.g_value.distances_adap_value(self.source, self.trace)
self.record = self.compute_record()
self.total_time = 0
self.total_time_regular = 0
self.total_time_non = 0
self.total_time_value = 0
self.total_time_once = 0
def compute_record(self):
self.g = dijkstra.Dijkstra(N, self.a, self.b, adapton_list.l2ll(self.d))
return self.g.compute_record(self.source, self.trace)
