DynDiGraph.has_predecessor(u, v, t=None)

Return True if node u has predecessor v at time t (optional).

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

  • v (u,) – Nodes can be, for example, strings or numbers. Nodes must be hashable (and not None) Python objects.
  • t (snapshot id (default=None)) – If None will be returned the presence of the interaction on the flattened graph.