#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: |
-------------------------------------+-------------------------------------
Comment (by dcoudert):
Hello,
In method `check_weight_function`
- `Checks that an edge weight function outputs only numbers.` -> `Check
that an edge weight function outputs only numbers.`
- The title of the example `A wrong weight function::` must be changed.
The weight function is correct but not the edge label.
- `for e in self.edges():` -> `for e in self.edge_iterator():` ?
In method `shortest_paths`
- `If the weight function is wrong::` same as above
Also I'm wondering if we may have conflicts with tickets #18868 about
memory allocation and #18864 on eccentricity
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/18938#comment:11>
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.
