A* search algorithm: Difference between revisions
Content added Content deleted
(→{{header|Phix}}: extra credit) |
m (→Extra credit) |
||
| Line 1,815: | Line 1,815: | ||
The : represent nodes it did not even look at, the . those added but never gone back to, obviously x represent the path, and together _ and x all nodes actually analysed. |
The : represent nodes it did not even look at, the . those added but never gone back to, obviously x represent the path, and together _ and x all nodes actually analysed. |
||
==Extra credit== |
===Extra credit=== |
||
Well, why not. Note this does not reuse/share any code with the above, although I presume the |
Well, why not. Note this does not reuse/share any code with the above, although I presume the |
||
task author assumed it would, instead the main loop uses a priority queue to obtain the next |
task author assumed it would, instead the main loop uses a priority queue to obtain the next |
||