

def has_predecessor(self, u, v):
    'Return True if node u has predecessor v.\n\n        This is true if graph has the edge u<-v.\n        '
    return ((u in self.pred) and (v in self.pred[v]))

dataset/ETHPy150Open networkx/networkx/networkx/classes/tests/timingclasses.py TimingDiGraph.has_predecessor/VarMisuse@33/82 `u`->`v`