Motivation
A* search algorithm has been shown to be faster in finding the shortest path for graph exploration.
As a result, it could be a useful tool for a MCP/ACP layer for graph exploration
Pitch
Add additional a_star_search functionality in paths.py find_shortest_paths with selectable option which algorithm to use.
Alternatives
Keep everything as is. BFS is still good.
Additional context
No response
Motivation
A* search algorithm has been shown to be faster in finding the shortest path for graph exploration.
As a result, it could be a useful tool for a MCP/ACP layer for graph exploration
Pitch
Add additional
a_star_searchfunctionality inpaths.pyfind_shortest_pathswith selectable option which algorithm to use.Alternatives
Keep everything as is. BFS is still good.
Additional context
No response