dynetworkx.ImpulseGraph.has_edge

ImpulseGraph.has_edge(u, v, begin=None, end=None, inclusive=(True, True))

Return True if there exists an edge between u and v in the impulse graph, during the given interval.

Parameters:

• v (u,) – Nodes can be, for example, strings or numbers. Nodes must be hashable (and not None) Python objects.
• begin (int or float, optional (default= beginning of the entire impulse graph)) –
• end (int or float, optional (default= end of the entire impulse graph)) – Must be bigger than or equal begin.
• inclusive (2-tuple boolean that determines inclusivity of begin and end) –

Examples

>>> G = dnx.ImpulseGraph()
>>> G.add_edges_from([(1, 2, 10), (2, 4, 11)])
>>> G.has_edge(1, 2)
True
>>> G.has_edge(1, 2, begin=2)
True
>>> G.has_edge(2, 4, begin=12)
False