#8703: Combinatorial Rooted Ordered and Binary Trees
-----------------------------+----------------------------------------------
Reporter: hivert | Owner: hivert
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: combinatorics | Keywords: trees
Work_issues: | Upstream: N/A
Reviewer: | Author: Florent Hivert, Frédéric
Chapoton
Merged: | Dependencies: #8702
-----------------------------+----------------------------------------------
Changes (by hivert):
* work_issues: Backward incompat change decision =>
Old description:
> The patch defines several new classes for dealing with
>
> - rooted recursive ordered trees (labelled and not)
>
> - binary trees (labelled and not)
>
> It also add the computation of the binary search tree and the decreasing
> or increasing tree for a permutation
>
> It finally defines the bijection to Dyck words
New description:
The patch defines several new classes for dealing with
- rooted recursive ordered trees (labelled and not)
- binary trees (labelled and not)
It also add the computation of the binary search tree and the decreasing
or increasing tree for a permutation
It finally defines the bijection to Dyck words
'''Apply:''' [attachment:trac_8703-trees-fh.patch]
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8703#comment:9>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
