public void ComputeInfluenceBFS(AgentUnit unit, Vector2[,] influenceMap, UnitT targetType = UnitT.MELEE, bool considerUnit = false)
{
HashSet <Node> pending = new HashSet <Node>();
HashSet <Node> visited = new HashSet <Node>();
Node vert = Map.NodeFromPosition(unit.position);
pending.Add(vert);
// BFS for assigning influence
for (int i = 1; i <= RadiusInfluenceMap; i++)
{
HashSet <Node> frontier = new HashSet <Node>();
foreach (Node p in pending)
{
if (visited.Contains(p))
{
continue;
}
visited.Add(p);
if (!considerUnit)
{
p.SetInfluence(unit.faction, unit.GetDropOff(1 + Util.HorizontalDist(p.worldPosition, unit.position)), influenceMap, InfluenceT.MAXIMUM);
}
else
{
float atkFactor = AgentUnit.atkTable[(int)unit.GetUnitType(), (int)targetType];
p.SetInfluence(unit.faction, atkFactor * unit.GetDropOff(1 + Util.HorizontalDist(p.worldPosition, unit.position)), influenceMap, InfluenceT.MAXIMUM);
}
frontier.UnionWith(Map.GetDirectNeighbours(p));
}
pending = new HashSet <Node>(frontier);
}
}
public void ComputeInfluenceDijkstra(AgentUnit unit, Vector2[,] influenceMap)
{
Node startNode = Map.NodeFromPosition(unit.position);
startNode.gCost = 1;
Heap <Node> openSet = new Heap <Node>(Map.GetMaxSize());
HashSet <Node> closedSet = new HashSet <Node>();
openSet.Add(startNode);
HashSet <Node> toReset = new HashSet <Node>();
while (openSet.Count > 0)
{
Node currentNode = openSet.Pop();
closedSet.Add(currentNode);
toReset.Add(currentNode);
currentNode.SetInfluence(unit.faction, unit.GetDropOff(currentNode.gCost), influenceMap, InfluenceT.ACCUMULATE);
if (closedSet.Count > NNodesInfluenceMap)
{
break;
}
foreach (Node neighbour in Map.GetNeighbours(currentNode))
{
if (!neighbour.isWalkable() || closedSet.Contains(neighbour))
{
continue;
}
//This penaly for the terrain is based on the idea that if you move from road to forest is slower than from forest to road
float newMovementCostToNeighbour = currentNode.gCost + PathUtil.realDist(currentNode, neighbour) * unit.Cost[neighbour.type];
if (newMovementCostToNeighbour < neighbour.gCost || !openSet.Contains(neighbour))
{
toReset.Add(neighbour);
neighbour.gCost = newMovementCostToNeighbour;
neighbour.hCost = 0;
if (!openSet.Contains(neighbour))
{
openSet.Add(neighbour);
}
else
{
openSet.UpdateItem(neighbour);
}
}
}
}
foreach (var node in toReset)
{
node.gCost = 0;
node.hCost = 0;
}
}