#18179: Random generation of Ordered rooted trees
-------------------------------------+-------------------------------------
Reporter: g.chatel | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: ordered trees, | Merged in:
combinatorics, random generation, | Reviewers:
sd67 | Work issues:
Authors: Grégory Châtel | Commit:
Report Upstream: N/A | 88d6199fe0ff88eb4fbe5ee9df480a690dec2262
Branch: | Stopgaps:
u/g.chatel/random_generation_of_ordered_rooted_trees|
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Replying to [comment:5 g.chatel]:
> This patch depends on a future patch on Dycks words to prevent creating
words of negative size.
Compiles & works. However, should it check for argument instead of
depending on `DyckWord` to do it? I dislike getting "wrong argument for
`foo`" after asking Sage "give me a `bar`".
For posets one can say `Posets.RandomPoset(5, 0.3)` or
`Posets(5).random_element()`; latter is extremely slow for posets of size
7 or so. But I don't know how to unify random functions like these.
--
Ticket URL: <http://trac.sagemath.org/ticket/18179#comment:6>
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.
