#11053: improving shortest path all pairs through BFS computations
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.7.1
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Nathann Cohen
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Comment:
I had set this patch to "needs review", as I was wondering why Cython was
apparently slower than a C code I had written independently. Turns out the
different lies in how the vertices of the 2d grid (which is the graph on
which I was testing the performances) were labelled.
In the C code, they were labelled from left to right, then from top to
bottom, why Sage's numbering is much more random, hence different
performances in practice.
Hail Cython `;-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11053#comment:3>
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.
