Lines Matching refs:edges
90 # Representation of graph nodes. Basically a map of directed edges.
94 self.edges = {}
97 return "%s(%s) %s" % (self.name, self.visited, self.edges)
99 # Currently we don't track any node info besides its edges.
103 edge = self.edges.get(new_edge.key)
108 self.edges[new_edge.key] = new_edge
110 return [ e for e in self.edges.itervalues() if e.is_super() ]
112 return [ e for e in self.edges.itervalues() if e.is_subclass() ]
121 for e in self.edges.itervalues():
124 # Representation of directed graph edges.
181 # Copy all non-weak edges from super classes to their subclasses.
195 # Recursively copy all super-class edges.
198 # Copy strong super-class edges (ignoring sub-class edges) to the sub class.
200 for e in super_node.edges.itervalues():
210 sub_node.edges[new_edge.key] = new_edge
220 super_node.edges[sub_edge.key] = sub_edge
226 for edge in node.edges.itervalues():
229 log("Copied edges down <super> edges for %d graph nodes" % global_inc_copy)
244 for e in current.edges.itervalues():