Rooted trees

[hivert]

Implement combinatorial (unordered) rooted trees

This is done using ordered rooted trees as data structure, and recursive normalization.

CC: @sagetrac-sage-combinat @tscrim @darijgr

Component: combinatorics

Keywords: rooted trees

Author: Florent Hivert

Branch/Commit: dc8120f

Reviewer: Frédéric Chapoton, Darij Grinberg, Travis Scrimshaw

Issue created by migration from https://trac.sagemath.org/ticket/11529

[hivert]

Changed dependencies from #11407 to #11407, #10194

[hivert]

Description changed:

--- 
+++ 
@@ -1,3 +1,2 @@
 Implement combinatorial rooted trees also know as Cayley trees
 
-Patch in preparation on sage-combinat 

[dkrenn]

comment:2

Attachment: trac_11529-rooted_trees-fh.patch.gz

Patch cannot be applied. If this is just because of the unfinished #10194 (I don't know the current status of that), then it can be set back to "need review".