#19457: Generator for full binary trees
-------------------------------------+-------------------------------------
Reporter: patxiku | Owner: patxiku
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-7.1
Component: combinatorics | Resolution:
Keywords: binary trees, | Merged in:
full |
Authors: Adrien | Reviewers: Travis Scrimshaw,
Boussicault, Bérénice Delcroix- | Vincent Delecroix
Oger, Patxi Laborde-Zubieta |
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/full_binary_trees-19457|
bc75b9cec7b7d44cb79f1901ace26a695b7acd87
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by patxiku):
Thank you Travis for taking care of the façade issues, I did not know how
to do it.
I did not find a nice name to replace `to_full`.
What about making a function `to_full` with an optional argument
completion that can be equal to `minimal` or `bijective` :
*`minimal` would give access to the operation you mentioned
*`bijective` to the operation I wanted to implement initially
--
Ticket URL: <https://trac.sagemath.org/ticket/19457#comment:14>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
