#7966: Giving some punch to distance computations
-------------------------------+--------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: Paul Zimmermann | Merged:
Work_issues: |
-------------------------------+--------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Comment:
At first, the function associated a path from v to each other vertex,
possibly empty if there was none. Then I noticed the other functions in
Sage expected the dictionary to only contain keys corresponding to the
vertices reachable from v (which was sound, too), and changed the original
function, forgetting the docstrings... Fixed now !
And I also removed the (commented) loop which was associating empty paths
when needed...
Thank you again ! :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7966#comment:4>
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.