如何实现A *算法？ [英] How to implement an A* algorithm?

问题描述

哪种方法应该可以在C＃中简单实现A *（星型）算法？

Which should be the way to get a simple implementation of A* (A star) algorithm in C#?

推荐答案

< a href = https://web.archive.org/web/20170505034417/http://blog.two-cats.com/2014/06/a-star-example/ rel = nofollow noreferrer>本文解释了基本的实现方式：

This article explains the basic implementation in length:

这篇博客的目的是通过一个真正的例子来展示A *的基本原理。简单的C＃实现。

The goal of this blog post is to show the fundamentals of A* through a really simple C# implementation.

它也指出了更好的实现，更适合生产使用：

It also points to better implementations, more suitable for production use:

至于找到更好路线的方法，周围有很多C＃示例比这更好，更丰富。 CastorTiu 在CodeProject上有一个非常好的演示解决方案， C＃中的A *算法实现，该算法可对搜索算法进行动画处理并允许用户调整一些设置。 [...]

As for ways to find better routes, there are plenty of C# examples around that are far better and richer than this one. CastorTiu has a really nice demo solution on CodeProject, A* algorithm implementation in C#, that animates the search algorithm and allows the user to tweak a few settings. [...]

EpPathFinding.cs-一种基于C＃（基于网格）的快速路径查找算法（跳转点搜索）。它具有一个漂亮，清晰的GUI，并可以调整一些设置。

EpPathFinding.cs- A Fast Path Finding Algorithm (Jump Point Search) in C# (grid-based). It has a nice, clear GUI and allows a few settings to be tweaked.

这篇关于如何实现A *算法？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！