#8703: Combinatorial Rooted Ordered and Binary Trees
-----------------------------------------------------+----------------------
Reporter: hivert | Owner: hivert
Type: enhancement | Status:
needs_review
Priority: major | Milestone: sage-5.7
Component: combinatorics | Resolution:
Keywords: trees, Cernay2012 | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Florent Hivert, Frédéric Chapoton | Merged in:
Dependencies: #8702 | Stopgaps:
-----------------------------------------------------+----------------------
Comment (by stumpc5):
The patch looks very complete, thanks you!
One thing I noticed: I would like to be able to reconstruct a tree from
its string representation. I.e.,
{{{
sage: BinaryTree("[., [[., [., .]], .]]")
}}}
Unfortunately, this resulted in an infinite recursion. It would be great
if you could fix this.
(I am not yet done with my review...)
Cheers, Christian
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8703#comment:21>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
