#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 | 85e609108945c191046f46af12019128f57b9104
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
public/19520 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by git):
* commit: 72dd8ddead628d7a383f88038bfe781b1e7ad520 =>
85e609108945c191046f46af12019128f57b9104
Comment:
Branch pushed to git repo; I updated commit sha1. New commits:
||[http://git.sagemath.org/sage.git/commit/?id=85e609108945c191046f46af12019128f57b9104
85e6091]||{{{trac #19520 more comments in the code, use assert to check
the number of edges}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/19520#comment:41>
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.
