#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: Yann Laigle-Chapuy | Merged:
Work_issues: |
----------------------------------+-----------------------------------------
Changes (by jdemeyer):
* status: positive_review => needs_work
Comment:
[attachment:trac_10905.patch] needs a proper commit message (use `hg
qrefresh -e` to change the message).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10905#comment:15>
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.
