

def has_successor(self, u, v):
    'Return True if node u has successor v.\n\n        This is true if graph has the edge u->v.\n        '
    return ((u in self.succ) and (v in self.succ[u]))

dataset/ETHPy150Open networkx/networkx/networkx/classes/tests/timingclasses.py TimingDiGraph.has_successor/original