A* is one of the most used algorithms used for pathfinding in games, being nothing more than an heuristic base Dijkstra it tends to give a faster solution if the heuristic is chosen correctly for the current graph. This particular implementation is in c++ and C#.

Here is a link to my github page that has my implementation of the algorithm. A* Implementation.