This project is creating a route planner in Udacity C++ Nanodegree Program.
Finds a path from the start node to the goal node by checking for open neighbors of the current node, computing a heuristic for each of the neighbors, and adding those neighbors to the list of open nodes to explore next. The next node to explore is the one with the lowest total cost + heuristic (g + h). This process is repeated until the end is found, as long as there are still open nodes to explore.
Route Planning