The A* implementation in alg/astar_path applies the heuristic function to the current node and its successors. It should apply the heuristic to the current node and the target node.
The consequence is that this implementation is not optimal, it visits many more nodes than it should, and it really isn't A* at all.
The A* implementation in alg/astar_path applies the heuristic function to the current node and its successors. It should apply the heuristic to the current node and the target node.
The consequence is that this implementation is not optimal, it visits many more nodes than it should, and it really isn't A* at all.
https://github.com/aysylu/loom/blob/master/src/loom/alg.cljc#L638
I created a pull request that adds a test to demonstrate this deficiency: #81