#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 dcoudert):
I solved the issue using int instead of ushort for indexes inside the
{{{init_short_digraph}}} method. I can now do:
{{{
sage: G = graphs.RandomBarabasiAlbert(65535,2)
sage: G.distances_distribution()
{1: 131066/2147385345, 2: 680474/715795115, 3: 6950033/715795115, 4:
152193754/2147385345, 5: 5581714/20451289, 6: 908791864/2147385345, 7:
86464963/429477069, 8: 8886494/429477069, 9: 539641/2147385345, 10:
244/2147385345}
}}}
So now it is working as expected/documented !
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13970#comment:11>
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.