此为用
C#写的A*
算法源代码
using System;
using System.Collections.Generic;
using System.Text;
using System.Drawing;
namespace EtSoft.AS
tarLib
{
public
class AS
tar
{
private S
tarNodeCollection openList = new S
tarNodeCollection();
private S
tarNodeCollection closeList = new S
tarNodeCollection();
public S
tarNode currentNode = null;
#region 构造函数
/// <summary>
/// 使用指定的地图对象、起点和终点初始化A星
算法
/// </summary>
/// <param name="map">地图对象</param>
public AS
tar(Map map)
{
this.map = map;
}
/// <summary>
///
/// </summary>
/// <param name="map">地图对象</param>
/// <param name="s
tart">起点坐标</param>
/// <param name="end">终点坐标</param>
public AS
tar(Map map, Point s
tart, Point end)
: this(map)
{
this.s
tart = new S
tarNode(s
tart);
this.end = new S
tarNode(end);
openList.Add(new S
tarNode(s
tart));
//AddS
tartNodeToOpenList(this.s
tart);
}
/// <summary>
///
/// </summary>
/// <param name="map">地图对象</param>
/// <param name="s
tartX">起点X坐标</param>
/// <param name="s
tartY">起点Y坐标</param>
/// <param name="endX">终点X坐标</param>
/// <param name="endY">终点Y坐标</param>
public AS
tar(Map map, int s
tartX, int s
tartY, int endX, int endY)
: this(map, new Point(s
tartX, s
tartY), new Point(endX, endY))
{ }
#endregion
#region 属性
protected Map map;
/// <summary>
/// 地图数据
/// </summary>
public Map Map
{
get { return map; }
set { map = value; }
}
private S
tarNode s
tart = null;
/// <summary>
/// 起点坐标，如果没有设置起点，返回null
/// </summary>
public S
tarNode S
tart
{
get
{
return s
tart;
}
set
{
s
tart = value;
openList.Clear();
openList.Add(s
tart);
//AddNodeToOpenList(s
tart);
}
}
private S
tarNode end = null;
/// <summary>
/// 终点坐标，如果没有设置终点，返回null
/// </summary>
public S
tarNode End
{
get
{
return end;
}
set { end = value; }
}
private S
tarNodeCollection
path;
/// <summary>
/// 返回路径节点集合，没有路径则返回null
/// </summary>
public S
tarNodeCollection
Path
{
get { return
path; }
}
private bool allDirection = false;
/// <summary>
/// true，允许八方向寻路
/// </summary>
public bool AllDirection
{
get { return allDirection; }
set { allDirection = value; }
}
#endregion
/// <summary>
/// 开始寻路
/// </summary>
public void S
tartSearch
Path()
{
if (s
tart == null)
throw new InvalidNodeException(InvalidNodeTypes.NoS
tart);
if (end == null)
throw new InvalidNodeException(InvalidNodeTypes.NoEnd);
path = null;
openList.Clear();
closeList.Clear();
currentNode = s
tart;
Search
Path(currentNode);
}
//寻路递归，受保护的虚方法，允许在子类重写寻路
算法
protected virtual void Search
Path(S
tarNode s
tarNode)
{
//currentNode = s
tarNode;
openList.Remove(s
tarNode);
closeList.Add(s
tarNode);
AddNodeToOpenList();
if (closeList.Contains(end))
{
//如果终点在关闭列表中，找到路径
S
tarNode node=s
tarNode.Parent;
path = new S
tarNodeCollection();
do
{
path.Add(node);
node = node.Parent;
} while (node != null && !node.Equals(s
tart));
path.Reverse();
return;
}
else if (openList.Count == 0)
{
//终点不在关闭列表，开放列表已空，没有可通行的路径
return;
}
currentNode = GetNextNode();
//迭代过程
Search
Path(currentNode);
}
/// <summary>
/// 获得当前节点的下一个最佳节点
/// </summary>
/// <returns></returns>
public S
tarNode GetNextNode()
{
openList.SortByF();
return openList[0];
}
/// <summary>
/// 把当前点周围可通过的点加入到开放列表中
/// </summary>
本文介绍了A*算法的基本原理和C#实现，包括使用启发函数、OpenList和CloseList的概念。通过示例代码展示了如何在C#中创建AStarAlgo类，实现路径搜索过程，并提供了部分代码片段和完整算法代码的下载链接。
最低0.47元/天 解锁文章
201
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
