#18250: G.triangles_count speedup
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.7
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Vincent Delecroix
theory | Work issues:
Keywords: | Commit:
Authors: | fd88c98cfc2fee8d0750cd9b6f88d1d7b8177ed4
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18250 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Replying to [comment:22 ncohen]:
> Ahahah. So if you have three vertices and 4 edges in between, then it is
not a triangle? No problem, yet another definition
No. It is not a triangle. But it does contain many triangles. It is very
much like on the sphere. For each (non degenerate) triple of points you
have '''4''' triangles whose vertices are exactly these points.
--
Ticket URL: <http://trac.sagemath.org/ticket/18250#comment:23>
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.
