A Star search & Greedy search Algorithm implementation on Romania Map problem in C programming language.
-
Updated
Dec 2, 2024 - C
A Star search & Greedy search Algorithm implementation on Romania Map problem in C programming language.
The AI Searches repository provides a Jupyter Notebook demonstrating the implementation of various AI search algorithms commonly used in optimization and pathfinding problems. It includes algorithms such as Breadth-First Search (BFS), Depth-First Search (DFS), Uniform Cost Search (UCS), Greedy Best-First Search, and A* Search.
Add a description, image, and links to the greedy-search-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the greedy-search-algorithm topic, visit your repo's landing page and select "manage topics."