public static List<Hex> BreadthFirstSearch(Hex source, List<List<Hex>> map, int moves, Team team)
{
Queue<Hex> queue = new Queue<Hex>();
List<Hex> found = new List<Hex>();
List<Hex> visited = new List<Hex>();
source.Adjacent(map).ForEach(h => queue.Enqueue(h));
Hex current = null;
while(queue.Count > 0) {
current = queue.Dequeue();
if(DepthFirstSearch(source, current, map, moves, team == 0).Count > 0 && !visited.Contains(current) && (team == Team.NEUTRAL || (current.Unit == null || current.Unit.Team == ((team == Team.ME) ? Team.ENEMY : Team.ME)))) {
found.Add(current);
current.Adjacent(map).ForEach(h => queue.Enqueue(h));
}
visited.Add(current);
}
return found;
}
static List<Hex> DFS(Hex thisHex, Hex toHex, List<List<Hex>> map, int moves, List<Hex> acc, bool ignoreUnits)
{
try {
if(thisHex.GridPosition != toHex.GridPosition) {
if(moves < 1) {
return new List<Hex>();
} else {
List<Hex> adj = thisHex.Adjacent(map);
if(!ignoreUnits) {
adj.RemoveAll (h => !(h.Unit == null || h.GridPosition == targetTile.GridPosition));
}
Hex nextHex = null;
foreach(Hex h in adj) {
if(nextHex != null) {
float oldD = Mathf.Sqrt(
Mathf.Pow(nextHex.GridPosition.x - toHex.GridPosition.x, 2) +
Mathf.Pow(nextHex.GridPosition.y - toHex.GridPosition.y, 2)
);
float newD = Mathf.Sqrt(
Mathf.Pow(h.GridPosition.x - toHex.GridPosition.x, 2) +
Mathf.Pow(h.GridPosition.y - toHex.GridPosition.y, 2)
);
if(newD < oldD) {
nextHex = h;
}
} else {
nextHex = h;
}
}
acc.Add(nextHex);
return DFS (nextHex, toHex, map, moves-1, acc, ignoreUnits);
}
} else { return acc; }
} catch {
return acc;
}
}
void getMoves(Hex hex, int i, List<Hex> acc)
{
if(i < 1) {
return;
} else {
List<Hex> adj = hex.Adjacent(gameControl.GridControl.Map).FindAll(h => !acc.Contains(h) && (h.Unit == null || (h.Unit.Team != 0 && h.Unit.Team != player.Team)));
acc.AddRange(adj);
adj.ForEach(h => getMoves(h, --i, acc));
}
}