networkx.Graph.neighbors_iter

Graph.neighbors_iter(n)

Return an iterator over all neighbors of node n.

Notes

It is faster to use the idiom “in G[0]”, e.g. >>> for n in G[0]: ... print n 1

Examples

>>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc
>>> G.add_path([0,1,2,3])
>>> print [n for n in G.neighbors_iter(0)]
[1]