Timeline for Understanding an algorithm for the gas station problem
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2019 at 8:56 | comment | added | fuglede | Besides being careful about what happens for $q = 1$, you also need to take care to fill out the table with meaningful values when the inner loop runs out of elements. Moreover, if I'm reading it correctly,, the algorithm appears to completely ignore the case $c(v) > c(u)$ (cf. this CS SE question), so something needs to be done there as well. | |
| May 21, 2014 at 16:50 | history | edited | Juho | CC BY-SA 3.0 | deleted 60 characters in body |
| May 20, 2014 at 16:20 | vote | accept | Wojciech Kulik | ||
| May 20, 2014 at 1:37 | review | First posts | |||
| May 20, 2014 at 3:01 | |||||
| May 20, 2014 at 1:32 | history | edited | j_random_hacker | CC BY-SA 3.0 | Think I found the main problem :) |
| May 20, 2014 at 1:20 | history | answered | j_random_hacker | CC BY-SA 3.0 |