A* 用 C 实现
在哪里可以找到 C 语言的 A* 实现?
我四处寻找,但似乎我的 google-fu 不够强大。我已经开始编写自己的实现,但后来我想起了 Stack Overflow,我想我应该先在这里问。编写一个真正的 A* 实现似乎有点复杂 - 我很想为二进制网格编写 Dijkstra 算法的实现,因为这就是我真正需要的,但我觉得我想要我的曲目中有一个 CA* 实现。
Where can I find an A* implementation in C?
I was looking around but it seems my google-fu is not strong enough. I've started writing my own implementation, but then I remembered Stack Overflow and I thought I should ask here first. It seems a bit complicated to write a real A* implementation - I was tempted to just write an implementation of Dijkstra's algorithm for a binary grid, since that's all I really need, but I feel like I want to have a C A* implementation in my repertoire.
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(2)
你的 google-fu 确实很弱,年轻的学徒 :-)
尝试用谷歌搜索
astar c
。第一个和第二个链接是实际的代码实现(第一个链接在自由麻省理工学院许可下,不知道第二个链接) 。
Your google-fu is indeed weak, young padawan :-)
Try googling for
astar c
.The first and second links are actual code implementations (the first under a liberal MIT licence, no idea about the second).
在这里你可以找到伪代码: http://en.wikipedia.org/wiki/A*
要找到适合您的代码,只需搜索:
astar图搜索算法C
here you can find the pseudocode: http://en.wikipedia.org/wiki/A*
to find the right code for you just search after:
astar graph search algorithm C