Timeline for Shortest Path using DFS on weighted graphs
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 13, 2019 at 14:55 | comment | added | BearAqua the Logician | Just a pointer, but maybe you'd like to know more about repeated relaxation and Bellman-Ford. | |
| Sep 3, 2017 at 15:58 | comment | added | Zephyr | I am not that good at rigorous proofs, so I tried disproving it but I am not able to find an example . Can you please give me an example where the above pseudo code fails ? | |
| Sep 3, 2017 at 15:53 | comment | added | Yuval Filmus | Have you tried proving that it works? That's how we know if things are true or not in math. | |
| Sep 3, 2017 at 15:24 | comment | added | Zephyr | I know that its run time is pretty bad. I just want to know if this pseudo code will work or not. According to me it should work. | |
| Sep 3, 2017 at 15:22 | comment | added | Yuval Filmus | Now that you have pseudocode, you can try proving that it works. The next step would be estimating its running time. | |
| Sep 3, 2017 at 15:20 | history | edited | Zephyr | CC BY-SA 3.0 |
added 402 characters in body
|
| Sep 3, 2017 at 13:10 | history | asked | Zephyr | CC BY-SA 3.0 |