Summary
A* is a pathfinding algorithm based on Dikjstra. It computes one of the best path to reach two nodes in a graph. It’s one of the most used pathfinding algorithm in video games. This implementation takes a ppm image as world and return the result in a ppm image. It allows user to simply create a world and see the generated path.
Around
All the resources (code, makefile, etc) are freely available on github here:
Technical stuff
I only used C++ with no external library to implement A* algorithm.
