Timeline for A* pathfinding algorithm too slow
Current License: CC BY-SA 4.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 26, 2019 at 22:49 | comment | added | Josiah | Without disputing the principle in general, Python specifically uses "Timsort" which is better optimised to handle near-sorted lists than say quicksort. | |
Jun 26, 2019 at 22:07 | comment | added | AlexV | @AndréRocha: Because that's what priority queues are made for. | |
Jun 26, 2019 at 22:06 | comment | added | André Rocha | You mean a sorted dictionary with the f cost as key? That makes sense I guess but wouldn't extra code be needed for the cases where multiple nodes have the same cost? popping from lists is easy but doing it from a dictionary is a pain | |
Jun 26, 2019 at 21:45 | history | answered | vnp | CC BY-SA 4.0 |