A* Pathfinding Simulator

This is just a small simulator showing how the A* pathfinding algorithm works on a grid based graph. 

A* is used in a plethora of real-life applications, video games being one of the most common. If you're interested in how it works, a simplified description of the algorithm is below. Thanks for checking it out!

A* Search:

-Start at the source node, traverse all immediate neighbors. 

-Choose neighbor with lowest f cost, that being the distance from the source (g) added to the heuristic estimation to target (h)

-Repeat with chosen node and its neighbors, continually choosing lowest f cost node from total set of visited nodes.

-Stop when we get to the target, trace back to find our shortest path.