#10905: shortest path all pairs through BFS computations.
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: tbd
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.7
Component: graph theory | Keywords:
Author: Nathann Cohen | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Changes (by ylchapuy):
* status: needs_review => needs_work
Comment:
Now that I stopped playing making it faster some remarks for the review:
* doctest the ValueError (and correct the small bug I guess)
* same remark as #10855 concerning method vs function (might be
irrelevant)
* in generic_graph.py, lines 11088-11089: typo one Cython should be
Python
* doctest this ValueError too
* doctest the by_weight stuff
otherwise sounds good
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10905#comment:8>
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.
