public static List <Vector2D> FindPath(RoomUser User, bool Diag, Room Room, Vector2D Start, Vector2D End)
{
var Path = new List <Vector2D>();
PathFinderNode Nodes = FindPathReversed(User, Diag, Room, Start, End);
if (Nodes != null)
{
Path.Add(End);
while (Nodes.Next != null)
{
Path.Add(Nodes.Next.Position);
Nodes = Nodes.Next;
}
}
//Path.Reverse();
return(Path);
}
public static PathFinderNode FindPathReversed(RoomUser User, bool Diag, Room Room, Vector2D Start,
Vector2D End)
{
var OpenList = new MinHeap <PathFinderNode>(256);
var PfMap = new PathFinderNode[Room.RoomMapManager.MaxMapX + 1, Room.RoomMapManager.MaxMapY + 1];
PathFinderNode Node;
Vector2D Tmp;
int Cost;
int Diff;
var current = new PathFinderNode(Start)
{
Cost = 0
};
var Finish = new PathFinderNode(End);
PfMap[current.Position.X, current.Position.Y] = current;
OpenList.Add(current);
while (OpenList.Count > 0)
{
current = OpenList.ExtractFirst();
current.InClosed = true;
for (int i = 0; Diag?i < DiagMovePoints.Length : i < NoDiagMovePoints.Length; i++)
{
Tmp = current.Position + (Diag ? DiagMovePoints[i] : NoDiagMovePoints[i]);
bool IsFinalMove = (Tmp.X == End.X && Tmp.Y == End.Y);
bool canWalk = Room.RoomMapManager.CanWalkOn(Tmp.X, Tmp.Y);
if (canWalk)
{
try
{
if (PfMap[Tmp.X, Tmp.Y] == null)
{
Node = new PathFinderNode(Tmp);
PfMap[Tmp.X, Tmp.Y] = Node;
}
else
{
Node = PfMap[Tmp.X, Tmp.Y];
}
if (!Node.InClosed)
{
Diff = 0;
if (current.Position.X != Node.Position.X)
{
Diff += 1;
}
if (current.Position.Y != Node.Position.Y)
{
Diff += 1;
}
Cost = current.Cost + Diff + Node.Position.GetDistanceSquared(End);
if (Cost < Node.Cost)
{
Node.Cost = Cost;
Node.Next = current;
}
if (!Node.InOpen)
{
if (Node.Equals(Finish))
{
Node.Next = current;
return(Node);
}
Node.InOpen = true;
OpenList.Add(Node);
}
}
}
catch
{
}
}
}
}
return(null);
}
