Skip to main content
`Ctrl`+`K`

# DiGraph.adj

property DiGraph.adj

  Graph adjacency object holding the neighbors 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 edge-data-dict. So `G.adj[3][2]['color'] = 'blue'` sets the color of the edge `(3, 2)` to `"blue"`.

  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.adj` holds outgoing (successor) info.