public AstarNode(Vector3Int position, AstarNode parent, Dungeon dungeon)
{
Position = position;
Parent = parent;
Neighbours = new List <Vector3Int>();
_dungeon = dungeon;
}
public int CompareTo(AstarNode node)
{
if (Mathf.Abs(node.TotalCost - TotalCost) > Mathf.Epsilon)
{
return((TotalCost < node.TotalCost) ? -1 : 1);
}
return((DistanceToEnd < node.DistanceToEnd) ? -1 : 1);
}
private AstarPath GetPathbetweenExits(Vector3Int start, Vector3Int end)
{
if (start == end)
{
return(new AstarPath(_dungeon, new List <Vector3Int> {
end
}));
}
HashSet <Vector3Int> checkedNodes = new HashSet <Vector3Int>();
List <AstarNode> uncheckedNodes = new List <AstarNode>();
var toCheck = _featureExits[start].Clone();
toCheck.CalculateNeighbours(ref checkedNodes, ref uncheckedNodes, ref _featureExits, end);
checkedNodes.Add(start);
uncheckedNodes.Sort((x, y) => x.CompareTo(y));
AstarNode endNode = null;
while (uncheckedNodes.Count > 0 && endNode == null)
{
toCheck = uncheckedNodes[0];
uncheckedNodes.RemoveAt(0);
if (checkedNodes.Contains(toCheck.Position))
{
continue;
}
toCheck.CalculateNeighbours(ref checkedNodes, ref uncheckedNodes, ref _featureExits, end);
checkedNodes.Add(toCheck.Position);
if (toCheck.Position == end)
{
endNode = toCheck;
}
uncheckedNodes.Sort((x, y) => x.CompareTo(y));
}
AstarPath path = new AstarPath(_dungeon, new List <Vector3Int>());
if (endNode != null)
{
var pathFromNode = endNode.GetPath(out path.Distance);
pathFromNode.Reverse();
path.RoomPoints.AddRange(pathFromNode);
}
uncheckedNodes = null;
checkedNodes = null;
return(endNode != null ? path : null);
}
public List <Vector3Int> GetPathBetweenPoints(Vector3Int start, Vector3Int end)
{
HashSet <Vector3Int> checkedNodes = new HashSet <Vector3Int>();
List <AstarNode> uncheckedNodes = new List <AstarNode>();
var toCheck = _nodes[start].Clone();
toCheck.CalculateNeighbours(ref checkedNodes, ref uncheckedNodes, ref _nodes, end);
checkedNodes.Add(start);
uncheckedNodes.Sort((x, y) => x.CompareTo(y));
AstarNode endNode = null;
while (uncheckedNodes.Count > 0 && endNode == null)
{
toCheck = uncheckedNodes[0];
uncheckedNodes.RemoveAt(0);
if (checkedNodes.Contains(toCheck.Position))
{
continue;
}
toCheck.CalculateNeighbours(ref checkedNodes, ref uncheckedNodes, ref _nodes, end);
checkedNodes.Add(toCheck.Position);
if (toCheck.Position == end)
{
endNode = toCheck;
}
uncheckedNodes.Sort((x, y) => x.CompareTo(y));
}
float distance = 0;
Debug.Log("End Node is " + endNode?.Position);
var path = endNode?.GetPath(out distance);
path?.Reverse();
return(path);
}
public void Initialize(Dungeon dungeon)
{
_dungeon = dungeon;
_nodes = new Dictionary <Vector3Int, AstarNode>();
_featureExits = new Dictionary <Vector3Int, AstarNode>();
// loop through all the tiles
Vector3Int tilepos = dungeon.Tilemap.origin;
for (int i = 0; i < dungeon.Tilemap.size.x * dungeon.Tilemap.size.y; i++)
{
FloorTile tile = dungeon.Tilemap.GetTile <FloorTile>(tilepos);
if (tile != null)
{
var node = new AstarNode(tilepos, null, dungeon);
foreach (Vector3Int neighbour in dungeon.GetNeighboursByPosition(tilepos))
{
FloorTile neighbourTile = dungeon.Tilemap.GetTile <FloorTile>(neighbour);
if (neighbourTile != null)
{
node.Neighbours.Add(neighbour);
}
}
_nodes.Add(tilepos, node);
}
if (tilepos.x == dungeon.Tilemap.origin.x + dungeon.Tilemap.size.x - 1)
{
tilepos.x = dungeon.Tilemap.origin.x;
tilepos.y++;
}
else
{
tilepos.x++;
}
}
foreach (IFeature feature in dungeon.AllFeatures)
{
var exits = feature.GetExits();
foreach (Vector3Int exit in exits)
{
if (!_featureExits.ContainsKey(exit))
{
_featureExits.Add(exit, new AstarNode(exit, null, dungeon)
{
Neighbours = exits
});
}
else
{
_featureExits[exit].Neighbours.AddRange(exits);
}
_featureExits[exit].Neighbours = _featureExits[exit].Neighbours.Distinct().ToList();
}
}
}
