parameters: (self, n)
docstring: PORTED FROM NETWORKX
          Returns an iterator over all neighbors of node n.
          This is identical to `iter(G[n])`
          Parameters
          ----------
          n : node
             A node in the graph
          Returns
          -------
          neighbors : iterator
              An iterator over all neighbors of node n
          Raises
          ------
          NetworkXError
              If the node n is not in the graph.
          Examples
          --------
          >>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> [n for n in G.neighbors(0)]
          [1]
          Notes
          -----
          Alternate ways to access the neighbors are ``G.adj[n]`` or ``G[n]``:
          >>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> G.add_edge('a', 'b', weight=7)
          >>> G['a']
          AtlasView({'b': {'weight': 7}})
          >>> G = nx.path_graph(4)
          >>> [n for n in G[0]]
          [1]
docstring_summary: PORTED FROM NETWORKX
          Returns an iterator over all neighbors of node n.
          This is identical to `iter(G[n])`
          Parameters
          ----------
          n : node
             A node in the graph
          Returns
          -------
          neighbors : iterator
              An iterator over all neighbors of node n
          Raises
          ------
          NetworkXError
              If the node n is not in the graph.
          Examples
          --------
          >>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> [n for n in G.neighbors(0)]
          [1]
          Notes
          -----
          Alternate ways to access the neighbors are ``G.adj[n]`` or ``G[n]``:
          >>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> G.add_edge('a', 'b', weight=7)
          >>> G['a']
          AtlasView({'b': {'weight': 7}})
          >>> G = nx.path_graph(4)
          >>> [n for n in G[0]]
          [1]
docstring_tokens: PORTED FROM NETWORKX Returns an iterator over all neighbors of node n . This is identical to iter ( G [ n ] ) Parameters ---------- n : node A node in the graph Returns ------- neighbors : iterator An iterator over all neighbors of node n Raises ------ NetworkXError If the node n is not in the graph . Examples -------- >>> G = nx . path_graph ( 4 ) # or DiGraph MultiGraph MultiDiGraph etc >>> [ n for n in G . neighbors ( 0 ) ] [ 1 ] Notes ----- Alternate ways to access the neighbors are G . adj [ n ] or G [ n ] : >>> G = nx . Graph () # or DiGraph MultiGraph MultiDiGraph etc >>> G . add_edge ( a b weight = 7 ) >>> G [ a ] AtlasView ( { b : { weight : 7 }} ) >>> G = nx . path_graph ( 4 ) >>> [ n for n in G [ 0 ]] [ 1 ]
function: def neighbors(self, n):
          """PORTED FROM NETWORKX
          Returns an iterator over all neighbors of node n.
          This is identical to `iter(G[n])`
          Parameters
          ----------
          n : node
             A node in the graph
          Returns
          -------
          neighbors : iterator
              An iterator over all neighbors of node n
          Raises
          ------
          NetworkXError
              If the node n is not in the graph.
          Examples
          --------
          >>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> [n for n in G.neighbors(0)]
          [1]
          Notes
          -----
          Alternate ways to access the neighbors are ``G.adj[n]`` or ``G[n]``:
          >>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc
          >>> G.add_edge('a', 'b', weight=7)
          >>> G['a']
          AtlasView({'b': {'weight': 7}})
          >>> G = nx.path_graph(4)
          >>> [n for n in G[0]]
          [1]
          """
          try:
              return iter(self.adj[n])
          except KeyError:
              raise SnapXError("The node {} is not in the graph.".format(n))
function_tokens: def neighbors ( self , n ) : try : return iter ( self . adj [ n ] ) except KeyError : raise SnapXError ( "The node {} is not in the graph." . format ( n ) )