public void Pathfind_StartOutOfMatrix_2()
{
AStarWithMinBinary aStar = new AStarWithMinBinary(7, 7);
Vector2 startPosition = new Vector2(0, -1);
Vector2 endPosition = new Vector2(6, 6);
aStar.FindPath(startPosition, endPosition);
foreach (AStarWithMinBinaryHeapNode node in aStar.matrix)
{
Assert.AreEqual(null, node.nextNode);
}
}
public void Pathfind_EndIsObstacle()
{
AStarWithMinBinary aStar = new AStarWithMinBinary(7, 7);
Vector2 startPosition = new Vector2(0, 0);
Vector2 endPosition = new Vector2(6, 6);
aStar.SetObstacle(new Vector2(6, 6));
aStar.FindPath(startPosition, endPosition);
foreach (AStarWithMinBinaryHeapNode node in aStar.matrix)
{
Assert.AreEqual(null, node.nextNode);
}
}
public void Pathfind_CanFind_NoObstacle()
{
AStarWithMinBinary aStar = new AStarWithMinBinary(7, 7);
Vector2 startPosition = new Vector2(0, 0);
Vector2 endPosition = new Vector2(6, 6);
aStar.FindPath(startPosition, endPosition);
/*
* ↓ ← ← ← ← ← E
*
* ↓ ← ↑ ↑ ↑ ↑ 0
*
* ↓ ← 0 0 0 0 0
*
* ↓ ← 0 0 0 0 0
*
* ↓ ← 0 0 0 0 0
*
* ↓ ← 0 0 0 0 0
*
* S ← 0 0 0 0 0
*/
AStarWithMinBinaryHeapNode[,] matrix = aStar.matrix;
AStarWithMinBinaryHeapNode[,] nextNodes = new AStarWithMinBinaryHeapNode[7, 7]
{
{ null, matrix[0, 0], null, null, null, null, null },
{ matrix[0, 0], matrix[0, 1], null, null, null, null, null },
{ matrix[0, 1], matrix[0, 2], null, null, null, null, null },
{ matrix[0, 2], matrix[0, 3], null, null, null, null, null },
{ matrix[0, 3], matrix[0, 4], null, null, null, null, null },
{ matrix[0, 4], matrix[0, 5], matrix[2, 6], matrix[3, 6], matrix[4, 6], matrix[5, 6], null },
{ matrix[0, 5], matrix[0, 6], matrix[1, 6], matrix[2, 6], matrix[3, 6], matrix[4, 6], matrix[5, 6] }
};
for (int x = 0; x < 7; x++)
{
for (int y = 0; y < 7; y++)
{
Assert.AreEqual(nextNodes[y, x], aStar.matrix[x, y].nextNode); //二维数组赋值是按照横竖x的方式进行的，也就是说上面的矩阵写错了，要转置，这就是一个用 [y, x] 一个用 [x, y] 的原因
}
}
}
public void SetObstacle_Normal()
{
Vector2 obstaclePosition = new Vector2(5, 3);
AStarWithMinBinary aStar = new AStarWithMinBinary(10, 10);
aStar.SetObstacle(obstaclePosition);
for (int x = 0; x < aStar.matrix.GetLength(0); x++)
{
for (int y = 0; y < aStar.matrix.GetLength(1); y++)
{
if (x != (int)obstaclePosition.x || y != (int)obstaclePosition.y)
{
Assert.IsTrue(aStar.matrix[x, y].canThrough);
}
else
{
Assert.IsFalse(aStar.matrix[x, y].canThrough);
}
}
}
}
void CreatAStar()
{
_aStar = new AStarWithMinBinary(_width, _height);
}
