grid_pathfinding
grid_pathfinding copied to clipboard
tbvanderwoude
Faster priority queue implementation
Currently a binary heap is used. Alternatives include a pairing heap or a radix heap. This could bring insertion cost down from Θ(log n) to Θ(1)
