#12306: Static sparse graphs for fast low-level computations
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.0
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Nathann Cohen
Merged: | Dependencies: 12235
----------------------------+-----------------------------------------------
Helloooooo !!
This extensively documented module implements a very basic data structure
for graphs that is helpful for *EFFICIENT* implementations. It was
actually used by Sage already in sage.graphs.distances_all_pairs, but it
is better to have a proper documentation for such things.
And of course, this does not solve the current lack of a Python-level
static graph class, that would handle loops/multiedges and labels... It
will come, though `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12306>
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.
