Timeline for Using Dijkstra's algorithm with negative edges?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 3, 2020 at 7:37 | comment | added | Peter | @D.W. it is not a repeat as the post only briefly explained what Dijkstra is, but did not say explain how greedy algo would not suffice. I also addressed the point that the OP was mentioning was actually Bellman Ford and elaborated why it is Bellman Ford | |
| May 3, 2020 at 7:32 | history | edited | Peter | CC BY-SA 4.0 |
deleted 19 characters in body
|
| May 3, 2020 at 6:09 | comment | added | D.W.♦ | cs.stackexchange.com/questions/2482/… | |
| May 3, 2020 at 2:16 | history | edited | Peter | CC BY-SA 4.0 |
added 91 characters in body
|
| May 3, 2020 at 2:05 | history | edited | Peter | CC BY-SA 4.0 |
added 1204 characters in body
|
| May 2, 2020 at 14:29 | comment | added | John L. | "It would then become Bellman-Ford." I can only upvote this answer if that proposition is explained clearly. It is unlikely it would become Bellman-Ford. | |
| May 2, 2020 at 6:22 | review | Late answers | |||
| May 2, 2020 at 13:50 | |||||
| May 2, 2020 at 6:08 | review | First posts | |||
| May 2, 2020 at 14:29 | |||||
| May 2, 2020 at 6:04 | history | answered | Peter | CC BY-SA 4.0 |