Timeline for Why does Dijkstra's algorithm fail on a negative weighted graphs?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 20, 2018 at 5:24 | comment | added | jeshwanth chowdary | @PeterTaylor Yes , edited . thank you . | |
| Sep 20, 2018 at 5:23 | history | edited | jeshwanth chowdary | CC BY-SA 4.0 |
added 176 characters in body
|
| Aug 30, 2018 at 9:58 | comment | added | Peter Taylor | There are instances of the shortest path problem with negative weight cycles where Dijkstra gives the correct answer. It requires (1) that the destination is not reachable from the cycle, and (2) that the destination is reached before any element of the cycle. | |
| Aug 29, 2018 at 19:21 | history | edited | jeshwanth chowdary | CC BY-SA 4.0 |
added 3 characters in body
|
| Aug 29, 2018 at 17:15 | review | Late answers | |||
| Aug 29, 2018 at 17:29 | |||||
| Aug 29, 2018 at 16:55 | review | First posts | |||
| Aug 29, 2018 at 18:54 | |||||
| Aug 29, 2018 at 16:55 | history | answered | jeshwanth chowdary | CC BY-SA 4.0 |