cirq.CircuitDag.has_predecessor

CircuitDag.has_predecessor(u, v)

Returns True if node u has predecessor v.

This is true if graph has the edge u<-v.