P289: Enumeration of all $n$-trees

P289: Enumeration of all $n$-trees

Input:

An integer $n$.

Output:

All $n$-trees.

Complexity:

$O(n^4N)$ total time.

Comment:

Reverse search. $N$ is the number of solutions.

Reference:

[Aringhieri2003] (Bibtex)