Return an adjacency list representation of the graph.
The output adjacency list is in the order of G.nodes(). For directed graphs, only outgoing adjacencies are included.
adj_list : lists of lists
The adjacency structure of the graph as a list of lists.
>>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc >>> G.add_path([0,1,2,3]) >>> G.adjacency_list() # in order given by G.nodes() [, [0, 2], [1, 3], ]