3 ms·

Actually for grid navigation there's no need for a priority queue. All steps are of length 1, so you can keep two arrays. In the first one all the things that

Actually for grid navigation there's no need for a priority queue. All steps are of length 1, so you can keep two arrays. In the first one all the things that you are currently visiting and push to the second array the neighbors that you'll visit in the next cycle. Once you are done swap arrays and start over.

rawling 5y ago
It's a grid, but with variable costs for entering each cell.
yxhuvud 5y ago
All steps of the grid didn't have the same cost in this problem though. In this case you'd need 11 different arrays to rotate around.