#15612: We need unordered trees
-----------------------------+----------------------------
Reporter: darij | Owner:
Type: task | Status: new
Priority: major | Milestone: sage-6.1
Component: combinatorics | Keywords: trees
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------
Of course, the actual implementation will have to wait for #14498 being
reviewed (hint, hint), but I guess it won't hurt to bring up the matter
now.
I'd really like to see unordered (=non-planar) trees of various varieties
(binary/arbitrary, labelled/unlabelled) being implemented in Sage.
("Unordered" means that the children of a vertex form a multiset, not a
list.) I'm wondering if it is possible to implement the labelled kind as a
finite set with a Maybe-endomorphism (i. e., a partial map from the set to
itself), because I guess this will be a lot faster than following the
recursive paradigm we currently have.
--
Ticket URL: <http://trac.sagemath.org/ticket/15612>
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/groups/opt_out.
