Timeline for Understanding an algorithm for the gas station problem
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2014 at 1:21 | comment | added | Sayan Bandyapadhyay | Ya,as you didn't mention that before I assumed all the cities are connected in a linear fashion (the graph is a simple path). | |
| May 20, 2014 at 1:14 | comment | added | Wojciech Kulik | Thank you for your answer! Unfortunately I didn't specified myself clearly enough. You assumed, that graph will be as simple as my example, but it can be any graph i.e. there can be also roads 0->2, 1->3 etc. | |
| May 20, 2014 at 1:11 | history | edited | Sayan Bandyapadhyay | CC BY-SA 3.0 | corrections |
| May 20, 2014 at 1:05 | history | answered | Sayan Bandyapadhyay | CC BY-SA 3.0 |