go 实现图遍历和路径搜索算法

发布于 2020-05-30 23:42:17

描述

实现A 算法。A 是图遍历和路径搜索算法

例子:

Input: Start (0,0) Goal (8,8)

[1 1 1 3 1 1 1 1 1]
[1 1 X 1 1 1 1 1 1]
[1 X 1 1 1 1 1 1 1]
[X 1 1 1 1 1 1 1 1]
[1 1 1 1 1 1 1 1 1]
[1 1 1 1 1 1 1 1 1]
[1 1 1 1 1 1 1 1 1]
[1 1 1 1 1 1 1 1 1]
[1 1 1 1 1 1 1 1 1]

Output:

Distance: 15.313708498984763

[* * * 3 1 1 1 1 1]
[1 1 X * 1 1 1 1 1]
[1 X 1 1 * 1 1 1 1]
[X 1 1 1 1 * 1 1 1]
[1 1 1 1 1 1 * 1 1]
[1 1 1 1 1 1 1 * 1]
[1 1 1 1 1 1 1 * 1]
[1 1 1 1 1 1 1 1 *]
[1 1 1 1 1 1 1 1 *]

image.png

Image generated using https://github.com/shomali11/gridder

0 条评论

发布
问题