parameters: (self)
return_statement: return iter(self.adj.items())
docstring: PORTED FROM NETWORKX
          Returns an iterator over (node, adjacency dict) tuples for all nodes.
          For directed graphs, only outgoing neighbors/adjacencies are included.
          Returns
          -------
          adj_iter : iterator
             An iterator over (node, adjacency dictionary) for all nodes in
             the graph.
          Examples
          --------
          >>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> [(n, nbrdict) for n, nbrdict in G.adjacency()]
          [(0, {1: {}}), (1, {0: {}, 2: {}}), (2, {1: {}, 3: {}}), (3, {2: {}})]
docstring_summary: PORTED FROM NETWORKX
          Returns an iterator over (node, adjacency dict) tuples for all nodes.
          For directed graphs, only outgoing neighbors/adjacencies are included.
          Returns
          -------
          adj_iter : iterator
             An iterator over (node, adjacency dictionary) for all nodes in
             the graph.
          Examples
          --------
          >>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> [(n, nbrdict) for n, nbrdict in G.adjacency()]
          [(0, {1: {}}), (1, {0: {}, 2: {}}), (2, {1: {}, 3: {}}), (3, {2: {}})]
docstring_tokens: PORTED FROM NETWORKX Returns an iterator over ( node adjacency dict ) tuples for all nodes . For directed graphs only outgoing neighbors / adjacencies are included . Returns ------- adj_iter : iterator An iterator over ( node adjacency dictionary ) for all nodes in the graph . Examples -------- >>> G = nx . path_graph ( 4 ) # or DiGraph MultiGraph MultiDiGraph etc >>> [ ( n nbrdict ) for n nbrdict in G . adjacency () ] [ ( 0 { 1 : {} } ) ( 1 { 0 : {} 2 : {} } ) ( 2 { 1 : {} 3 : {} } ) ( 3 { 2 : {} } ) ]
function: def adjacency(self):
          """PORTED FROM NETWORKX
          Returns an iterator over (node, adjacency dict) tuples for all nodes.
          For directed graphs, only outgoing neighbors/adjacencies are included.
          Returns
          -------
          adj_iter : iterator
             An iterator over (node, adjacency dictionary) for all nodes in
             the graph.
          Examples
          --------
          >>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> [(n, nbrdict) for n, nbrdict in G.adjacency()]
          [(0, {1: {}}), (1, {0: {}, 2: {}}), (2, {1: {}, 3: {}}), (3, {2: {}})]
          """
          return iter(self.adj.items())
function_tokens: def adjacency ( self ) : return iter ( self . adj . items ( ) )