Searched defs:out_edges (Results 1 - 2 of 2) sorted by relevance

/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
H A DGraph.py213 for edge in self.out_edges(head):
320 l = [self.tail(n) for n in self.out_edges(node)]
337 def out_edges(self, node): member in class:Graph
363 return set(self.inc_edges(node) + self.out_edges(node))
369 return len(self.out_edges(node))
397 get_edges = self.out_edges
497 get_edges = self.out_edges
524 get_edges = self.out_edges
557 get_edges = self.out_edges
/external/valgrind/coregrind/
H A Dm_transtab.c214 predecessors in the control flow graph. 'out_edges' points
220 The 'out_edges' list exists only so that we can visit the
291 its out_edges. Furthermore, a matching out-in pair must have
294 a out_edges set may not have duplicates when using the
295 equality defined by (TTEntry,offset). Hence the out_edges
299 then A.out_edges = { (B,42), (B,87) } (in any order)
303 mapping between P.out_edges and Q.in_edges.
306 OutEdgeArr out_edges; member in struct:__anon20209
872 OutEdgeArr__add(&from_tte->out_edges, &oe);
939 // Find the corresponding entry in the "from" node's out_edges,
[all...]

Completed in 1139 milliseconds