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

问题描述

在 C# 中获得 A*(A 星)算法的简单实现的方法应该是什么?

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

推荐答案

这篇文章长篇大论讲解基本实现:

This article explains the basic implementation in length:

这篇博文的目标是通过一个非常简单的 C# 实现展示 A* 的基础知识.

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屋！