Enter search terms or a module, class or function name.
Return True if node u has predecessor v.
This is true if graph has the edge u<-v.