#11529: Rooted trees
-------------------------------------+-------------------------------------
Reporter: hivert | Owner: hivert
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: rooted trees, | Merged in:
Cayley | Reviewers:
Authors: Florent Hivert | Work issues:
Report Upstream: N/A | Commit:
Branch: | ac12f31827a5073a4f03fe6cc4db8e7714e51603
public/combinat/11529 | Stopgaps:
Dependencies: #11407 |
-------------------------------------+-------------------------------------
Comment (by darij):
Is this:
{{{
tst = (children.__class__ is self.__class__
and children.parent() == parent)
if not tst:
children = [self.__class__(parent, x) for x in children]
}}}
supposed to catch the case of `children` being a rooted tree? Because I'm
not sure I understand the logic. `childen` is a list; maybe you want
`x.__class__ for x in children` instead of `children.__class__`?
Also, as usual, I don't understand the classcall metaclass magic, so I am
just reading past it.
--
Ticket URL: <http://trac.sagemath.org/ticket/11529#comment:37>
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.
For more options, visit https://groups.google.com/d/optout.
