'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'

def next(self, delta=1):

    return Prufer.unrank((self.rank + delta), self.nodes)
