dynetx.DynDiGraph.has_predecessor

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.

Parameters

u, vnodes

Nodes can be, for example, strings or numbers. Nodes must be hashable (and not None) Python objects.

tsnapshot id (default=None)

If None will be returned the presence of the interaction on the flattened graph.