#13503: Enhancement of `is_triangle_free' addition of `triangles_count' and a
minor
change in `spanning_trees_count'
----------------------------------------------------------+-----------------
Reporter: azi | Owner:
jason, ncohen, rlm
Type: enhancement | Status:
needs_review
Priority: minor | Milestone:
sage-5.6
Component: graph theory | Resolution:
Keywords: triangles, graphs, number of triangles | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Jernej Azarija, David Coudert | Merged in:
Dependencies: | Stopgaps:
----------------------------------------------------------+-----------------
Changes (by dcoudert):
* status: needs_work => needs_review
Comment:
1. networkx uses dictionaries to store edges. If G is a networkx graph, it
is also a dictionary indexed by the vertices, and G[u] is a dictionary
indexed by neighbors and containing edge data. This way, iterations are
fast. I don't know exactly how are implemented sage graphs in the
backends, and so I don't know how to speedup the basic iterations over the
edges, the neighbors, etc. This is certainly needed.
2. I have implemented the proposed modification in {{{is_triangle_free}}}.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13503#comment:34>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
