#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:
        Authors:  Florent Hivert     |    Reviewers:  Frédéric Chapoton,
Report Upstream:  N/A                |  Darij Grinberg, Travis Scrimshaw
         Branch:                     |  Work issues:
  public/combinat/11529              |       Commit:
   Dependencies:  #11407             |  554020502657566ed334823ac0d36e39b2fcb22d
                                     |     Stopgaps:
-------------------------------------+-------------------------------------

Comment (by tscrim):

 Replying to [comment:46 darij]:
 > The changes look OK to me (except I still don't understand the
 > {{{
 > if not (children.__class__ is self.__class__
 >         and children.parent() == parent):
 > }}}
 > check).

 That is making sure that the children are also rooted subtrees of the same
 parent (you can think of it like a linked list, but instead of a separate
 class for nodes, it links to a smaller list).

 > Thank you for looking at this, Travis!

 The least I could do.

--
Ticket URL: <http://trac.sagemath.org/ticket/11529#comment:47>
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.

Reply via email to