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

 * author:   => Michele Borassi
 * cc: ncohen, dcoudert (added)
 * component:  PLEASE CHANGE => graph theory
 * keywords:   => Shortest path, eccentricity, Dijkstra
 * type:  PLEASE CHANGE => defect


Old description:



New description:

 At the moment, there are several methods that compute shortest paths.
 However, there is no standard for inputs and outputs of these methods:

  * some of them only work with unweighted graphs (distance_all_pairs(),
 distances_distribution(), eccentricity());
  * some of them use default_weight (shortest_path_all_pairs), while others
 do not check weights (shortest_paths)
  * some of them output paths, while others output predecessors
 (shortest_path_all_pairs).

 The goal of this ticket is to standardize all these behaviors, and to make
 all routines work also with weighted graphs. The schema of the routine
 calls I would like to implement is attached (some calls are already
 present).

 As a next step, we will include some Boost shortest path algorithms
 (Bellman-Ford, Johnson), with ticket !#18931.

--

--
Ticket URL: <http://trac.sagemath.org/ticket/18938#comment:1>
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