Added a class called "AStar" which uses the A* algorithm to find
shortest path. Also added PathSpeedTest which compares how fast A* and
Dijkstra work. A* generally finds the path much faster. When we are
certain that A* works, we will delete the Dijkstra class.