DirectedTopology.
has_predecessor
Return True if node u has predecessor v.
This is true if graph has the edge u<-v.