Various pathfinding algorithms in C++
On my machine: Intel(R) Core(TM) i7-4700HQ CPU @ 2.40GHz (Quadcore), 12GB
Compiler: G++ 4.9.2
On a 500x500x500 grid with some obstacles.
1.A*: Classic A* using hash maps for both the open and closed list.
- Time: 38ms
- Memory usage: 692.6kB
2.A*Quick: Classic A* using an ordered map along the hash map in the open list to keep track of the lowest cost node.
- Time: 3.3ms
- Memory usage: 1100.9kB
3.SMA*: Simplified Memory-Bounded A*. A low-memory variant of A*, implementation for now incomplete.