#12306: Static sparse graphs for fast low-level computations
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies: 12235
-----------------------------+----------------------------------------------
Changes (by dcoudert):
* reviewer: => David Coudert
Comment:
I can now install the patch with sage-5.0.beta2.
No compilation error. Generation of the documentation is OK.
However, can you improve in section `What does it take as input?` the
`n^2sizeof(...)` and the nsizeof(...). For instance you can add a \cdot
between `n` and `sizeof(...)`.
For functions returning a dictionnary of dictionnary, you should add an
extra warning recalling that such structures are huge. I'm not sure most
of us can use this for graphs with 10.000 nodes.
Best,
D.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12306#comment:4>
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.
