/// <summary>
/// Retrace path between two points.
/// </summary>
/// <param name="grid">Grid to work on.</param>
/// <param name="startNode">Starting node.</param>
/// <param name="endNode">Ending (target) node.</param>
/// <returns>Retraced path between nodes.</returns>
private static List <Node> RetracePath(DungeonGrid grid, Node startNode, Node endNode)
{
List <Node> path = new List <Node>();
Node currentNode = endNode;
while (currentNode != startNode)
{
path.Add(currentNode);
currentNode = currentNode.parent;
}
path.Reverse();
return(path);
}
/// <summary>
/// Find a path between two points.
/// </summary>
/// <param name="grid">Grid to search.</param>
/// <param name="startPos">Starting position.</param>
/// <param name="targetPos">Ending position.</param>
/// <param name="distance">The type of distance, Euclidean or Manhattan.</param>
/// <param name="ignorePrices">If true, will ignore tile price (how much it "cost" to walk on).</param>
/// <returns>List of points that represent the path to walk.</returns>
public static List <Vector2Int> FindPath(DungeonGrid grid, Vector2Int startPos, Vector2Int targetPos, System.Func <Vector2Int, Vector2Int, bool> isWalkableFrom, DistanceType distance = DistanceType.Euclidean, bool ignorePrices = false)
{
// find path
List <Node> nodes_path = _ImpFindPath(grid, startPos, targetPos, isWalkableFrom, distance, ignorePrices);
// convert to a list of points and return
List <Vector2Int> ret = new List <Vector2Int>();
if (nodes_path != null)
{
foreach (Node node in nodes_path)
{
ret.Add(new Vector2Int(node.gridX, node.gridY));
}
}
return(ret);
}
/// <summary>
/// Internal function that implements the path-finding algorithm.
/// </summary>
/// <param name="grid">Grid to search.</param>
/// <param name="startPos">Starting position.</param>
/// <param name="targetPos">Ending position.</param>
/// <param name="distance">The type of distance, Euclidean or Manhattan.</param>
/// <param name="ignorePrices">If true, will ignore tile price (how much it "cost" to walk on).</param>
/// <returns>List of grid nodes that represent the path to walk.</returns>
private static List <Node> _ImpFindPath(DungeonGrid grid, Vector2Int startPos, Vector2Int targetPos, System.Func <Vector2Int, Vector2Int, bool> isWalkableFrom, DistanceType distance = DistanceType.Euclidean, bool ignorePrices = false)
{
// Node startNode = grid.nodes[startPos.x, startPos.y];
// Node targetNode = grid.nodes[targetPos.x, targetPos.y];
Node startNode = grid.At(startPos.x, startPos.y);
Node targetNode = grid.At(targetPos.x, targetPos.y);
if (startNode == null)
{
Debug.LogError("startNode null!");
return(new List <Node>());
}
if (targetNode == null)
{
Debug.LogError("targetNode null!");
return(new List <Node>());
}
List <Node> openSet = new List <Node>();
HashSet <Node> closedSet = new HashSet <Node>();
openSet.Add(startNode);
while (openSet.Count > 0)
{
Node currentNode = openSet[0];
for (int i = 1; i < openSet.Count; i++)
{
if (openSet[i].fCost < currentNode.fCost || openSet[i].fCost == currentNode.fCost && openSet[i].hCost < currentNode.hCost)
{
currentNode = openSet[i];
}
}
openSet.Remove(currentNode);
closedSet.Add(currentNode);
if (currentNode == targetNode)
{
return(RetracePath(grid, startNode, targetNode));
}
foreach (Node neighbour in grid.GetNeighbours(currentNode, distance, isWalkableFrom))
{
if (!neighbour.walkable || closedSet.Contains(neighbour))
{
continue;
}
int newMovementCostToNeighbour = currentNode.gCost + GetDistance(currentNode, neighbour) * (ignorePrices ? 1 : (int)(10.0f * neighbour.price));
if (newMovementCostToNeighbour < neighbour.gCost || !openSet.Contains(neighbour))
{
neighbour.gCost = newMovementCostToNeighbour;
neighbour.hCost = GetDistance(neighbour, targetNode);
neighbour.parent = currentNode;
if (!openSet.Contains(neighbour))
{
openSet.Add(neighbour);
}
}
}
}
return(null);
}
