3.3.3.5. networkx.DiGraph.in_edges¶

DiGraph.in_edges(nbunch=None, data=False)[source]¶

Return an iterator over the incoming edges.

Parameters:

nbunch : iterable container, optional (default= all nodes)

A container of nodes. The container will be iterated through once.

data : bool, optional (default=False)

If True, return edge attribute dict in 3-tuple (u,v,data).

Returns:

in_edge : iterator

An iterator over (u,v) or (u,v,d) tuples of incoming edges.