class_docstr: The Prufer correspondence is an algorithm that describes the
  bijection between labeled trees and the Prufer code. A Prufer
  code of a labeled tree is unique up to isomorphism and has
  a length of n - 2.
  
  Prufer sequences were first used by Heinz Prufer to give a
  proof of Cayley's formula.
  
  References
  ==========
  
  .. [1] https://mathworld.wolfram.com/LabeledTree.html
class_docstr_tok: ["The","Prufer","correspondence","is","an","algorithm","that","describes","the","bijection","between","labeled","trees","and","the","Prufer","code",".","A","Prufer","code","of","a","labeled","tree","is","unique","up","to","isomorphism","and","has","a","length","of","n","-","2",".","Prufer","sequences","were","first","used","by","Heinz","Prufer","to","give","a","proof","of","Cayley","'s","formula",".","References","==========","..","[","1","]","https",":","\/\/mathworld.wolfram.com\/LabeledTree.html"]
docstr: Generates the Prufer sequence that is delta beyond the current one.
  
  Examples
  ========
  
  >>> from sympy.combinatorics.prufer import Prufer
  >>> a = Prufer([[0, 1], [0, 2], [0, 3]])
  >>> b = a.next(1) # == a.next()
  >>> b.tree_repr
  [[0, 2], [0, 1], [1, 3]]
  >>> b.rank
  1
  
  See Also
  ========
  
  prufer_rank, rank, prev, size
docstr_tok: ["Generates","the","Prufer","sequence","that","is","delta","beyond","the","current","one",".","Examples","========",">",">",">","from","sympy.combinatorics.prufer","import","Prufer",">",">",">","a","=","Prufer","(","[","[","0",",","1","]",",","[","0",",","2","]",",","[","0",",","3","]","]",")",">",">",">","b","=","a.next","(","1",")","#","==","a.next","(",")",">",">",">","b.tree_repr","[","[","0",",","2","]",",","[","0",",","1","]",",","[","1",",","3","]","]",">",">",">","b.rank","1","See","Also","========","prufer_rank",",","rank",",","prev",",","size"]
code: def next(self, delta=1):
      """Generates the Prufer sequence that is delta beyond the current one.
  
      Examples
      ========
  
      >>> from sympy.combinatorics.prufer import Prufer
      >>> a = Prufer([[0, 1], [0, 2], [0, 3]])
      >>> b = a.next(1) # == a.next()
      >>> b.tree_repr
      [[0, 2], [0, 1], [1, 3]]
      >>> b.rank
      1
  
      See Also
      ========
  
      prufer_rank, rank, prev, size
  
      """
      return Prufer.unrank(self.rank + delta, self.nodes)
  
imports: from sympy.core import Basic
  from sympy.core.containers import Tuple
  from sympy.tensor.array import Array
  from sympy.core.sympify import _sympify
  from sympy.utilities.iterables import flatten, iterable
  from sympy.utilities.misc import as_int
  from collections import defaultdict
label_desc: Use image node_id 12 for calling the Prufer obj's underlying member method code with example usage: obj.next(delta) and returns: Prufer