a short subtitle
This is a simpler project that demonstrates another sorting algorithm - the A* sorting algorithm, which basically finds the path between two given points.
The UI is made using pygame again. The program starts off by letting the user choose 2 given points between (0,0) and (49,49). Then the user can draw blockades using the mouse. The program will then find the best path between the two points taking into account the user blockades. There is a "live visualization" option or a quick solve option depending on whether you want to see the algorithm or just the final path/product!
CLICK THE ICON BELOW TO VIEW TO VIEW THE SOURCE CODE ON GITHUB!