#13970: Fix memory allocation in distances all pairs
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.7
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers: Nathann Cohen
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
> With 65534 nodes, the {{{init_short_digraph}}} method takes a few
seconds. With 65535 nodes, I had to kill the process (after > 1 hour). I
don't know yet whats going on. I have to investigate further with some
print statements...
AHahaha. Yeah. I know why : infinite loop `:-P`
Because of something like that :
{{{
cdef unsigned short i
for 0<= i <2^16:
pass
}}}
And of course the loop never ends, for adding 1 to 2^16-1 makes it equal
to 0.
Should raise an exception, though `:-P`
Nathan
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13970#comment:9>
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.
