Content deleted Content added
Hart~enwiki (talk | contribs) |
No edit summary |
||
Line 44:
It seems to me that this intuitive view is still of interest, I hope that it's more than a purely historical curiousity.
== Missing details ==
1. Description on path reconstruction from closed priority queue: The article claims that the path can be reconstructed from the closed priority queue, without storing the path so far at each node. The article directs the reader to "see below" for a description of the advertised technique, but that description is nowhere to be found.
2. Check candidate nodes to see if they're already in Closed AND Open: The article mentions that you must check if a candidate node is already in the closed priority queue. I have read other descriptions such as Amit Patel's which is linked at the bottom of the page which states that you should also check if the candidate node is already in the open priority queue. Experimentally I determined that the algorithm runs at unacceptable speeds unless I perform this additional check.
Since I am in no position of authority on A* I have not made any edits to the article. Hopefully someone else can address these two issues.
| |||