#14056: Distance matrix
--------------------------------+-------------------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: trivial | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by ncohen):
Hellooooooo again !
Ok, then this change in the loops is a wrong idea. If you want your
"distance_matrix" to run fast on large instances though [1] you could
implement the code of this distance_matrix function directly in the
distances_all_pairs.pyx file. This way you would not have to go through a
dictionary, and more importantly Sage would not create a dictionary from a
matrix only to create a matrix from the dictionary afterwards.
Before the dictionary is created, all the data is contained in a C array
that is much easier to transform into a matrix than this dictionary.
Not to mention that it takes MUuuuuuuuuuuuchh less space in memory.
Have fuuuuuuuuuuuuuuuuuuuuuuuunnn !!
Nathann
[1] Really, if you want. Otherwise this patch is fine without it
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14056#comment:26>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
