# Pathfinding
Various pathfinding algorithms in C++

# Pathfinding
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.

## The algorithms:

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: 4ms    
* Memory usage: 1100.9kB

Add time/memory usage information for A* and A*Quick
Add time/memory usage information for A* and A*Quick