Timeline for Example of a graph with negative weighed edges in which Dijkstra's algorithm does work
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 20, 2021 at 20:01 | comment | added | templatetypedef | @nirshahar Good point - my original wording was ambiguous. Answer updated! | |
| Aug 20, 2021 at 20:01 | history | edited | templatetypedef | CC BY-SA 4.0 |
added 41 characters in body
|
| Aug 20, 2021 at 16:16 | comment | added | nir shahar | If you also require that there is no path from those nodes back to the starting node $s$ that is cheap enough, this will work. Otherwise - it is not guaranteed (it can work, depending on the precise implementation of Djikstra's algorithm) :) | |
| Aug 20, 2021 at 13:24 | history | answered | templatetypedef | CC BY-SA 4.0 |