#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 vdelecroix):
Replying to [comment:2 ncohen]:
> Hello,
>
> If you add this then I do not think that we need our former
'randomtriangulation' anymore.
>
> Nathann
>
> P.S.: The difference between `listA += listB` and `listA.extend(listB)`
is that the first one creates a copy og `listA` first.
Where did you see that?
{{{
sage: l = [1,2]
sage: id(l)
140110919626336
sage: l += [4,5]
sage: id(l)
140110919626336
}}}
See also [http://stackoverflow.com/questions/9766387/different-behaviour-
for-list-iadd-and-list-add this stackoverflow question]
--
Ticket URL: <http://trac.sagemath.org/ticket/19520#comment:24>
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.
