Minimal A* implementation in C. No dynamic memory allocation.
-
Updated
Apr 17, 2024 - C
Minimal A* implementation in C. No dynamic memory allocation.
Classic n-puzzle problem solver using A* search
Visualization of A* Path Finding in C
Repository concerning the implementation of the A-star parallel algorithm developed for the High Performance Computing course at the Master's degree in Computer Science at University of Trento
Heuristic search to help Goku find the seven Dragon Balls
A small project that generates a 64 x 32 maze using depth-first search algorithm and solves paths within it using A*.
Implementation Floyd-Warshall Algorithm
Add a description, image, and links to the a-star topic page so that developers can more easily learn about it.
To associate your repository with the a-star topic, visit your repo's landing page and select "manage topics."