Timeline for Calculating the shortest route between two points
Current License: CC BY-SA 3.0
26 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 1, 2016 at 10:02 | audit | Triage | |||
| Oct 1, 2016 at 10:03 | |||||
| Sep 30, 2016 at 0:59 | audit | Close votes | |||
| Sep 30, 2016 at 0:59 | |||||
| Sep 27, 2016 at 17:40 | audit | Close votes | |||
| Sep 27, 2016 at 19:31 | |||||
| Sep 27, 2016 at 13:30 | audit | Triage | |||
| Sep 27, 2016 at 13:30 | |||||
| Sep 25, 2016 at 16:07 | audit | Close votes | |||
| Sep 25, 2016 at 19:02 | |||||
| Sep 24, 2016 at 16:31 | audit | Triage | |||
| Sep 24, 2016 at 17:09 | |||||
| Sep 21, 2016 at 17:49 | audit | Triage | |||
| Sep 21, 2016 at 18:20 | |||||
| Sep 19, 2016 at 8:37 | audit | Triage | |||
| Sep 19, 2016 at 8:38 | |||||
| Sep 16, 2016 at 12:55 | audit | Triage | |||
| Sep 16, 2016 at 12:56 | |||||
| Sep 14, 2016 at 12:10 | audit | Triage | |||
| Sep 14, 2016 at 12:22 | |||||
| Sep 11, 2016 at 5:48 | audit | Triage | |||
| Sep 11, 2016 at 5:48 | |||||
| Sep 1, 2016 at 9:25 | comment | added | Marco13 | The A* algorithm would also be applicable here. But note that Dijkstra and AStar only have a better asymptotic complexity than some other options. For example, for a 8x8 grid, a simple Breadth-first-search is likely to be faster in practice (also because it is simpler to implement). The performance advantages of Dijkstra may show up for larger grids, maybe 20x20 or so (depending on many factors - consider profiling them for the real application case!) | |
| Sep 1, 2016 at 7:10 | answer | added | rafana | timeline score: 1 | |
| Sep 1, 2016 at 4:15 | answer | added | Can Nguyen | timeline score: 3 | |
| Sep 1, 2016 at 1:59 | history | edited | Daniel Oliveira | CC BY-SA 3.0 |
deleted 1 character in body
|
| Sep 1, 2016 at 1:55 | vote | accept | Daniel Oliveira | ||
| S Aug 31, 2016 at 23:13 | history | suggested | Alex Filatov | CC BY-SA 3.0 |
fixed text
|
| Aug 31, 2016 at 21:06 | review | Suggested edits | |||
| S Aug 31, 2016 at 23:13 | |||||
| S Aug 31, 2016 at 20:45 | history | edited | Kᴏɴsᴛᴀɴᴛɪɴ Sʜɪʟᴏᴠ | CC BY-SA 3.0 |
simplify for understanding the question
|
| S Aug 31, 2016 at 20:45 | history | suggested | Alex Filatov | CC BY-SA 3.0 |
simplify for understanding the question
|
| Aug 31, 2016 at 20:30 | review | Suggested edits | |||
| S Aug 31, 2016 at 20:45 | |||||
| S Aug 31, 2016 at 20:14 | history | suggested | Alex Filatov | CC BY-SA 3.0 |
added algorithm tags
|
| Aug 31, 2016 at 18:16 | answer | added | Alex Filatov | timeline score: 19 | |
| Aug 31, 2016 at 18:12 | comment | added | roberrrt-s | Check out Dijkstra's algorithm, (en.wikipedia.org/wiki/Dijkstra%27s_algorithm) as well as this question. It should help you on your way. stackoverflow.com/questions/430142/… | |
| Aug 31, 2016 at 18:10 | review | Suggested edits | |||
| S Aug 31, 2016 at 20:14 | |||||
| Aug 31, 2016 at 18:09 | history | asked | Daniel Oliveira | CC BY-SA 3.0 |