Graph adjacency object holding the successors of each node.
This object is a read-only dict-like structure with node keys and neighbor-dict values. The neighbor-dict is keyed by neighbor to the edgekey-dict. So
G.adj['color'] = 'blue'sets the color of the edge
(3, 2, 0)to
Iterating over G.adj behaves like a dict. Useful idioms include
for nbr, datadict in G.adj[n].items():.
The neighbor information is also provided by subscripting the graph. So
for nbr, foovalue in G[node].data('foo', default=1):works.
For directed graphs,
G.succis identical to