#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:25 ncohen]:
> Oh, and then you will also have the guys who have a weight on their
edges and want to count the number of weighted triangles.
This is what I am thinking about when I consider a multi graph, it is just
a graph with (positive) integer labels. The weight of a triangle is the
product of the labels on the three edges. And to count triangles, you just
sum the weights. It is what you get from the matrix trace (when you
removed the loops).
But I agree that there is one ambiguity: you might want to count induced
C3.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/18250#comment:26>
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.
