def has_predecessor(self, u, v):
        return (u in self.pred and v in self.pred[u])
Return True if node u has predecessor v.
dataset/ETHPy150Open networkx/networkx/networkx/classes/tests/timingclasses.py/TimingDiGraph.has_predecessor