此为用C#写的
A*算法源
代码
using System;
using System.Collections.Generic;
using System.Text;
using System.Drawing;
namespace EtSoft.AStarLib
{
public class AStar
{
private StarNodeCollection openList = new StarNodeCollection
();
private StarNodeCollection closeList = new StarNodeCollection
();
public StarNode currentNode = null;
#region 构造函数
/// <summary>
/// 使用指定的地图对象、起点和终点初始化A星
算法
/// </summary>
/// <param name="map">地图对象</param>
public AStar
(Map map
)
{
this.map = map;
}
/// <summary>
///
/// </summary>
/// <param name="map">地图对象</param>
/// <param name="start">起点坐标</param>
/// <param name="end">终点坐标</param>
public AStar
(Map map, Point start, Point end
)
: this
(map
)
{
this.start = new StarNode
(start
);
this.end = new StarNode
(end
);
openList.Add
(new StarNode
(start
));
//AddStartNodeToOpenList
(this.start
);
}
/// <summary>
///
/// </summary>
/// <param name="map">地图对象</param>
/// <param name="startX">起点X坐标</param>
/// <param name="startY">起点Y坐标</param>
/// <param name="endX">终点X坐标</param>
/// <param name="endY">终点Y坐标</param>
public AStar
(Map map, int startX, int startY, int endX, int endY
)
: this
(map, new Point
(startX, startY
), new Point
(endX, endY
))
{ }
#endregion
#region 属性
protected Map map;
/// <summary>
/// 地图数据
/// </summary>
public Map Map
{
get { return map; }
set { map = value; }
}
private StarNode start = null;
/// <summary>
/// 起点坐标，如果没有设置起点，返回null
/// </summary>
public StarNode Start
{
get
{
return start;
}
set
{
start = value;
openList.Clear
();
openList.Add
(start
);
//AddNodeToOpenList
(start
);
}
}
private StarNode end = null;
/// <summary>
/// 终点坐标，如果没有设置终点，返回null
/// </summary>
public StarNode End
{
get
{
return end;
}
set { end = value; }
}
private StarNodeCollection path;
/// <summary>
/// 返回
路径节点集合，没有
路径则返回null
/// </summary>
public StarNodeCollection 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 StartSearchPath
()
{
if
(start == null
)
throw new InvalidNodeException
(InvalidNodeTypes.NoStart
);
if
(end == null
)
throw new InvalidNodeException
(InvalidNodeTypes.NoEnd
);
path = null;
openList.Clear
();
closeList.Clear
();
currentNode = start;
SearchPath
(currentNode
);
}
//寻路递归，受保护的虚方法，允许在子类重写寻路
算法
protected virtual void SearchPath
(StarNode starNode
)
{
//currentNode = starNode;
openList.Remove
(starNode
);
closeList.Add
(starNode
);
AddNodeToOpenList
();
if
(closeList.Contains
(end
))
{
//如果终点在关闭列表中，找到
路径
StarNode node=starNode.Parent;
path = new StarNodeCollection
();
do
{
path.Add
(node
);
node = node.Parent;
} while
(node != null && !node.Equals
(start
));
path.Reverse
();
return;
}
else if
(openList.Count == 0
)
{
//终点不在关闭列表，开放列表已空，没有可通行的
路径
return;
}
currentNode = GetNextNode
();
//迭代过程
SearchPath
(currentNode
);
}
/// <summary>
/// 获得当前节点的下一个最佳节点
/// </summary>
/// <returns></returns>
public StarNode GetNextNode
()
{
openList.SortByF
();
return openList[0];
}
/// <summary>
/// 把当前点周围可通过的点
加入到开放列表中
/// </summary>
本文介绍了A*算法的原理和实现细节，并提供了多种实现方式，包括从txt读取地图、命令行显示和MFC界面演示。还提供了源代码下载链接，包括基于txt的调试版本、exe演示程序和VS2010工程，帮助读者理解和应用A*算法。
最低0.47元/天 解锁文章
扫一扫
1650
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
