A* search algorithm: Difference between revisions
alphabetize, minor clean-up
m (Ol: small simplification) |
Thundergnat (talk | contribs) (alphabetize, minor clean-up) |
||
Line 494:
Path cost 11: (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 7) (7, 7)
</pre>
=={{header|D}}==
Line 847 ⟶ 846:
Cost: 11
</pre>
=={{header|Java}}==
<lang java>
Line 1,149:
[(1, 1) (2, 2) (2, 3) (2, 4) (2, 5) (2, 6) (3, 7) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) ]
</pre>
=={{header|Julia}}==
Line 1,539 ⟶ 1,538:
██████████
</pre>
=={{header|OCaml}}==
Line 2,828 ⟶ 2,826:
.......X
</pre>
=={{header|Sidef}}==
{{trans|Python}}
Line 2,949 ⟶ 2,948:
Path cost 11: [[0, 0], [1, 1], [2, 2], [3, 1], [4, 1], [5, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6], [7, 7]]
</pre>
=={{header|UNIX Shell}}==
{{works with|Bourne Again SHell}}
| |||