implementation of graph and tree search algorithms to find the path to the goal
in this project you can find below algorithms for solving the Romania Map problem(getting from Arad to Bucharest)-
- BFS
- Unlimited DFS
- Depth Limited DFS
- Iterative DFS
- Uniform Cost search
- Greedy Best First search
- Astar