#13730: Speed up some graph iterations
--------------------------------+-------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by azi):
Agree!
It seems like something suspiciously complex is being done in these
iterators (lists, to iterators, to sets, to iterators to sets..)
I've played around and removed the (intuitively) unneeded parts and
observed that there is a minor performance gain.
But if we want to be as fast as networkx then we'd need to keep a hash
table of neighbors for each vertex.
Before trying to implement this - does sage allow graphs with unhashable
vertices?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13730#comment:3>
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.
