#18938: Refactor shortest paths
-------------------------------------+-------------------------------------
       Reporter:  borassi            |        Owner:
           Type:  defect             |       Status:  new
       Priority:  major              |    Milestone:  sage-6.8
      Component:  graph theory       |   Resolution:
       Keywords:  Shortest path,     |    Merged in:
  eccentricity, Dijkstra             |    Reviewers:
        Authors:  Michele Borassi    |  Work issues:
Report Upstream:  N/A                |       Commit:
         Branch:                     |  dca691b5114e24d8a157a8b0bf7f92b2275a87e0
  u/borassi/refactor_shortest_paths  |     Stopgaps:
   Dependencies:                     |
-------------------------------------+-------------------------------------
Changes (by git):

 * commit:  a8d22178cff80ffe9da8d0b46c15ec30fe2d3a87 =>
     dca691b5114e24d8a157a8b0bf7f92b2275a87e0


Comment:

 Branch pushed to git repo; I updated commit sha1. New commits:
 
||[http://git.sagemath.org/sage.git/commit/?id=dca691b5114e24d8a157a8b0bf7f92b2275a87e0
 dca691b]||{{{Good quality shortest_paths, implemented other routines}}}||

--
Ticket URL: <http://trac.sagemath.org/ticket/18938#comment:9>
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.
For more options, visit https://groups.google.com/d/optout.

Reply via email to