This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Return an iterator over all neighbors of node n.
It is faster to use the idiom “in G”, e.g.
>>> G = nx.path_graph(4) >>> [n for n in G] 
>>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc >>> G.add_path([0,1,2,3]) >>> [n for n in G.neighbors_iter(0)]