#19520: implement random triangulations in a bijective way
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_review
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Nathann Cohen
theory | Work issues:
Keywords: | Commit:
random graph | 3a7356b7b4b667ebdaa8f955452e7c8aaefa283c
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
public/19520 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Oh, so that's the convention your worry about. Well, I'd say that until
your code proves to not be sufficiently fast we have no need for this kind
of optimisation (if it makes a difference). Avoiding a copy of the list
was sufficiently non-negligible, but that's not so bad. If it ever becomes
a problem, your code can easily be turned into more efficient Cython
anyway `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19520#comment:30>
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.
