Timeline for Why is my algorithm version so slow with this input?
Current License: CC BY-SA 4.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 16, 2020 at 12:17 | vote | accept | CommunityBot | ||
Jan 16, 2020 at 0:37 | comment | added | user114370 |
As final goal, I want the shortest path but not between 2 points: I need the shortest path collecting all the keys. Anyway for a single move between two keys, yes, it is Dijkstra algorithm: I'm assuming that part already solved and I start showing the pseudocode with the matrix of min distances between couple of keys already given, I'm calling it fullGrid or graph topology.
|
|
Jan 16, 2020 at 0:15 | comment | added | D.W.♦ | If you want the shortest path in a weighted grid graph, perhaps Dijkstra's algorithm is a better fit than BFS? You can think of Dijkstra's algorithm as BFS with a priority queue instead of an ordinary queue. I wonder if your solution is re-inventing Dijkstra's algorithm? | |
Jan 16, 2020 at 0:13 | history | reopened | D.W.♦ | ||
Jan 15, 2020 at 23:50 | history | edited | user114370 | CC BY-SA 4.0 |
edited body
|
Jan 15, 2020 at 23:45 | history | edited | user114370 | CC BY-SA 4.0 |
edited body
|
Jan 15, 2020 at 23:38 | history | edited | user114370 | CC BY-SA 4.0 |
deleted 1367 characters in body
|
Jan 15, 2020 at 17:55 | review | Reopen votes | |||
Jan 16, 2020 at 0:15 | |||||
Jan 15, 2020 at 17:40 | history | edited | user114370 | CC BY-SA 4.0 |
added 1170 characters in body
|
Jan 14, 2020 at 17:00 | history | closed | D.W.♦ | Not suitable for this site | |
Jan 14, 2020 at 15:39 | answer | added | user114370 | timeline score: 0 | |
Jan 14, 2020 at 12:45 | history | edited | user114370 | CC BY-SA 4.0 |
added 285 characters in body
|
Jan 14, 2020 at 12:22 | history | edited | user114370 | CC BY-SA 4.0 |
added 9 characters in body
|
Jan 14, 2020 at 12:20 | review | First posts | |||
Jan 14, 2020 at 17:05 | |||||
Jan 14, 2020 at 12:11 | history | asked | user114370 | CC BY-SA 4.0 |