/*
* Get List of tiles (Path) that will connect 2 city tiles
* */
public IEnumerable <Tile> GetPath(Tile startingTile, Tile destinationTile, PATHFINDING_MODE pathfindingMode)
{
Func <Tile, Tile, double> distance = (node1, node2) => 1;
Func <Tile, double> estimate = t => Math.Sqrt(Math.Pow(t.X - destinationTile.X, 2) + Math.Pow(t.Y - destinationTile.Y, 2));
var path = PathFind.PathFind.FindPath(startingTile, destinationTile, distance, estimate, pathfindingMode);
return(path);
}
public static Path <Node> FindPath <Node>(Node start, Node destination, Func <Node, Node, double> distance, Func <Node, double> estimate, PATHFINDING_MODE pathfindingMode)
where Node : IHasNeighbours <Node>
{
var closed = new HashSet <Node>();
var queue = new PriorityQueue <double, Path <Node> >();
queue.Enqueue(0, new Path <Node>(start));
Node lastStep = start;
while (!queue.IsEmpty)
{
var path = queue.Dequeue();
if (closed.Contains(path.LastStep))
{
continue;
}
if (path.LastStep.Equals(destination))
{
return(path);
}
closed.Add(path.LastStep);
lastStep = path.LastStep;
double d;
Path <Node> newPath;
if (pathfindingMode == PATHFINDING_MODE.ROAD_CREATION)
{
foreach (Node n in path.LastStep.ValidTiles)
{
d = distance(path.LastStep, n);
newPath = path.AddStep(n, d);
queue.Enqueue(newPath.TotalCost + estimate(n), newPath);
}
}
else if (pathfindingMode == PATHFINDING_MODE.COMBAT)
{
foreach (Node n in path.LastStep.CombatTiles)
{
d = distance(path.LastStep, n);
newPath = path.AddStep(n, d);
queue.Enqueue(newPath.TotalCost + estimate(n), newPath);
}
}
else
{
foreach (Node n in path.LastStep.RoadTiles)
{
d = distance(path.LastStep, n);
newPath = path.AddStep(n, d);
queue.Enqueue(newPath.TotalCost + estimate(n), newPath);
}
}
}
return(null);
}
