#7673: implement Dijkstra's algorithm for C graphs
----------------------------+-----------------------------------------------
Reporter: rlm | Owner: rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author: Nathann Cohen
Upstream: N/A | Reviewer: Robert Miller
Merged: |
----------------------------+-----------------------------------------------
Comment(by ncohen):
I do not think so, this bug just came from the fact that this version of
dijkstra is bidirectional, and I wrongly assumed that as in the simple
version of it, the first path found was the correct path. Obviously ( see
your example ) it is not, and I expect this version of the algorithm to be
correct :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7673#comment:13>
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.
