P378: Enumeration of all rooted trees with $n$ vertices

P378: Enumeration of all rooted trees with $n$ vertices

Input:

An integer $n$.

Output:

All rooted trees with $n$ vertices.

Complexity:

$O(1)$ amortized time per solution.

Comment:

Reference:

[Beyer1980] (Bibtex)