private static Stack <Position> ReestablishPath(List <HashSet <Position> > waves, Position start, Position finish, Greed greed)
{
var current = finish;
var level = waves.Count - 2;
var isBreak = false;
var path = new Stack <Position>();
while (!isBreak && level > -1)
{
isBreak = true;
var neighbors = greed.GetNearests(current);
foreach (var neighbor in neighbors)
{
if (waves[level].Contains(neighbor.Centre))
{
isBreak = false;
level--;
path.Push(current);
current = neighbor.Centre;
break;
}
}
}
if (isBreak)
{
return(null);
}
return(path);
}
private static bool FindFinish(List <HashSet <Position> > waves, Position start, Greed greed, out Position finish)
{
int level = 0;
var count = 1;
waves[0].Add(start);
var total = greed.Total();
var totalCount = 0;
var alreadyViewed = new HashSet <Position>()
{
start
};
while (count > 0 && totalCount <= total)
{
count = 0;
waves.Add(new HashSet <Position>());
foreach (var point in waves[level])
{
var neighbors = greed.GetNearests(point);
foreach (var neighbor in neighbors)
{
if (!alreadyViewed.Contains(neighbor.Centre))
{
if (greed.IsInDestinations(neighbor.Centre) &&
!greed.IsInBlocks(neighbor.Centre) &&
greed.IsInGreed(neighbor.Centre))
{
finish = new Position(neighbor.Centre.X, neighbor.Centre.Y);;
return(true);
}
else
{
count++;
totalCount += 1;
waves[level + 1].Add(neighbor.Centre);
alreadyViewed.Add(neighbor.Centre);
}
}
}
}
level++;
}
finish = null;
return(false);
}
