#7673: implement Dijkstra's algorithm for C graphs
----------------------------+-----------------------------------------------
Reporter: rlm | Owner: rlm
Type: defect | Status: needs_work
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 wdj):
Replying to [comment:9 ncohen]:
> Clearly, it is !! Thank you for taking a lot at it :-)
>
> Well, the only bugfix I can think about is to keep in memory the vertex
v such
> that dist_y[v] + dist_x[v] is minimal, and only build the path when
> the neighborhoods of x and y at distance 2*(dist_y[v] + dist_x[v]) have
> been explored. It clearly fixes your counter-example, and I think it
Maybe this is related to the "piority queue" in Demaine's descrition
of the algorithm in
{{{
http://ocw.mit.edu/NR/rdonlyres/Electrical-Engineering-and-Computer-
Science/6-046JFall-2005/651C0FC9-55D1-4404-A801-A9D0392A668C/0/lec17.pdf
}}}
at
{{{
http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-
Science/6-046JFall-2005/VideoLectures/detail/embed17.htm
}}}
> should solve all others, but I woud be glad to write a nicer solution...
> Any idea ? :-)
>
> Thank you very much again ! :-)
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7673#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 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.
