Lines Matching refs:self
25 def __init__(self, actions_list, src_image, tgt_image):
26 self.actions_list = actions_list
27 if len(self.actions_list) == 0:
29 self.size_of_source_list = 0
30 self.src_img_obj = src_image
31 self.tgt_img_obj = tgt_image
32 self.vertices = len(self.actions_list)
33 self.data_size = DATA_SIZE
35 self.generate_digraph()
36 self.stash_process()
38 def generate_digraph(self):
44 self.get_source_ranges(self.actions_list, source_ranges)
46 self.get_intersections_dict(source_ranges)
48 topo_logical = TopoLogical(self)
54 self.actions_list = new_action_list
56 def get_intersections_dict(self, source_ranges):
62 for each_action in self.actions_list:
72 self.update_goes_before_and_after(each_action, intersections)
118 def stash_process(self):
124 for each_action in self.actions_list:
145 def __init__(self, graph):
146 self.graph = graph
147 self.marked = [False for _ in range(self.graph.vertices)]
148 self.has_cycle = False
149 self.ontrack = [False for _ in range(self.graph.vertices)]
153 def __init__(self, graph):
154 self.graph = graph
155 self.marked = {}
156 self.stack = []
158 for each_action in self.graph.actions_list:
159 self.marked[each_action] = False
161 def dfs(self):
163 self.marked[index] = True
165 if not self.marked[each_child]:
167 self.stack.insert(0, index)
169 for each_action in self.graph.actions_list:
170 if not self.marked[each_action]:
172 return self.stack
174 def sort_vertices(self):
175 return self.dfs()
179 def __init__(self, graph):
180 self.order = None
181 self.cycle = DirectedCycle(graph)
182 if not self.cycle.has_cycle:
184 self.order = dfo.sort_vertices()
186 def stack(self):
187 return self.order