Lines Matching defs:succ

442             succ = result.group(2)
443             self.nodes[pred].successors.append(succ)
444             self.nodes[succ].predecessors.append(pred)
983     def visit_edge(self, pred, succ):
988                 succ.node_name(),
1053             for succ in sorted(graph.nodes[node].successors):
1054                 logging.debug("Visiting edge: %s -> %s " % (node, succ))
1055                 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
1076                 succ = graph.nodes[succ_id]
1078                 succ.predecessors = [node_id]