Add an example implementation of the A* shortest path algorithm in SearchingAlgorithms/GraphSearch/astar.py Suggested example: shortest path in a 2D world with Manhattan distance as the heuristic.
Add an example implementation of the A* shortest path algorithm in SearchingAlgorithms/GraphSearch/astar.py
Suggested example: shortest path in a 2D world with Manhattan distance as the heuristic.