public void SetHeuristic(Vect2 endPoint)
{
Heuristic = (int)Vect2.Dist(Position, endPoint);
}
public static List <AStarNode> GetRoute(AStarMap map)
{
List <AStarNode> open = new List <AStarNode>(map.Nodes.Count);
List <AStarNode> closed = new List <AStarNode>(map.Nodes.Count);
AStarNode cur = map.GetStartNode();
while (true)
{
if (open.Contains(cur))
{
open.Remove(cur);
}
closed.Add(cur);
if (cur.Adjason.Contains(map.GetEndNode()))
{
break;
}
cur.Adjason.RemoveAll(n => closed.Contains(n) || n.Blocked);
for (int i = 0; i < cur.Adjason.Count; i++)
{
AStarNode neighbour = cur.Adjason[i];
int moveCost = (int)(Math.Abs(Vect2.Dist(cur.Position, neighbour.Position) * 10000));
if (!neighbour.HasParent)
{
neighbour.SetParent(cur, moveCost);
}
if (cur.GValue + moveCost < neighbour.GValue)
{
neighbour.SetParent(cur, moveCost);
}
if (!open.Contains(neighbour))
{
open.Add(neighbour);
}
}
if (open.Count == 0)
{
return(new List <AStarNode>());
}
AStarNode min = open[0];
for (int i = 0; i < open.Count; i++)
{
if (min != open[i] && open[i].FValue < min.FValue)
{
min = open[i];
}
}
cur = min;
}
AStarNode end = map.GetEndNode();
end.SetParent(cur, (int)Vect2.Dist(cur.Position, end.Position));
List <AStarNode> result = new List <AStarNode>();
cur = end;
while (cur.HasParent)
{
result.Add(cur);
cur = cur.Parent;
}
return(result);
}