LevelGraphTests ClassDelta Engine Documentation
View code on GitHub
Inheritance Hierarchy
System Object
  DeltaEngine.GameLogic.PathFinding.Tests LevelGraphTests

Namespace: DeltaEngine.GameLogic.PathFinding.Tests
Assembly: DeltaEngine.GameLogic.PathFinding.Tests (in DeltaEngine.GameLogic.PathFinding.Tests.dll) Version: 1.1.1.0 (1.1.1)
Syntax
Copy to ClipboardPrint
public class LevelGraphTests

The LevelGraphTests type exposes the following members.

Constructors
  NameDescription
Public methodLevelGraphTests
Initializes a new instance of the LevelGraphTests class
Top
Methods
  NameDescription
Public methodCheckClosestNodeIndexGivenPosition
View code on GitHub
Public methodCheckForConnectedNodes
View code on GitHub
Public methodCheckForGraphBranches
View code on GitHub
Public methodCheckForNotConnectedNodes
View code on GitHub
Public methodCheckGetNodes
View code on GitHub
Public methodCheckNodePositions
View code on GitHub
Public methodCheckUpdateWeightInLinks
View code on GitHub
Public methodCreateGraphAs3X2Grid
0 - 1 - 2 | | | 3 - 4 - 5 View code on GitHub
Public methodMakingNodeReachableEnablesAllConnections
View code on GitHub
Public methodSetUnreachableNodeAndCheck
View code on GitHub
Public methodTestAllowingDiagonalPaths
View code on GitHub
Top
Examples
Copy to ClipboardPrint
[Test]
public void CheckNodePositions()
{
    Assert.AreEqual(new Vector2D(0, 0), grid3X2.GetNode(0).Position);
    Assert.AreEqual(new Vector2D(1, 0), grid3X2.GetNode(1).Position);
    Assert.AreEqual(new Vector2D(2, 0), grid3X2.GetNode(2).Position);
    Assert.AreEqual(new Vector2D(0, 1), grid3X2.GetNode(3).Position);
    Assert.AreEqual(new Vector2D(1, 1), grid3X2.GetNode(4).Position);
    Assert.AreEqual(new Vector2D(2, 1), grid3X2.GetNode(5).Position);
}
Copy to ClipboardPrint
[Test]
public void CheckForConnectedNodes()
{
    Assert.IsTrue(grid3X2.IsConnected(0, 1));
    Assert.IsTrue(grid3X2.IsConnected(1, 0));
    Assert.IsTrue(grid3X2.IsConnected(1, 4));
    Assert.IsTrue(grid3X2.IsConnected(2, 1));
    Assert.IsTrue(grid3X2.IsConnected(2, 5));
    Assert.IsTrue(grid3X2.IsConnected(3, 4));
    Assert.IsTrue(grid3X2.IsConnected(4, 5));
}
Copy to ClipboardPrint
[Test]
public void CheckForNotConnectedNodes()
{
    Assert.IsFalse(grid3X2.IsConnected(0, 4));
    Assert.IsFalse(grid3X2.IsConnected(4, 0));
    Assert.IsFalse(grid3X2.IsConnected(1, 3));
    Assert.IsFalse(grid3X2.IsConnected(3, 1));
    Assert.IsFalse(grid3X2.IsConnected(1, 5));
    Assert.IsFalse(grid3X2.IsConnected(5, 1));
    Assert.IsFalse(grid3X2.IsConnected(2, 4));
    Assert.IsFalse(grid3X2.IsConnected(4, 2));
    Assert.IsFalse(grid3X2.IsConnected(0, 5));
    Assert.IsFalse(grid3X2.IsConnected(5, 0));
    Assert.IsFalse(grid3X2.IsConnected(2, 3));
    Assert.IsFalse(grid3X2.IsConnected(3, 2));
}
Copy to ClipboardPrint
[Test]
public void CheckForGraphBranches()
{
    Assert.AreEqual(1, grid3X2.AdjacentLinks[0][0].TargetNode);
    Assert.AreEqual(3, grid3X2.AdjacentLinks[0][1].TargetNode);
    Assert.AreEqual(0, grid3X2.AdjacentLinks[1][0].TargetNode);
    Assert.AreEqual(2, grid3X2.AdjacentLinks[1][1].TargetNode);
    Assert.AreEqual(4, grid3X2.AdjacentLinks[1][2].TargetNode);
    Assert.AreEqual(1, grid3X2.AdjacentLinks[2][0].TargetNode);
    Assert.AreEqual(5, grid3X2.AdjacentLinks[2][1].TargetNode);
}
Copy to ClipboardPrint
[Test]
public void SetUnreachableNodeAndCheck()
{
    const int Index = 0;
    grid3X2.SetUnreachableAndUpdate(Index);
    Assert.IsFalse(grid3X2.AdjacentLinks[1][Index].IsActive);
    Assert.IsFalse(grid3X2.AdjacentLinks[3][Index].IsActive);
    Assert.IsTrue(grid3X2.IsUnreachableNode(0));
}
Copy to ClipboardPrint
[Test]
public void MakingNodeReachableEnablesAllConnections()
{
    const int Index = 0;
    grid3X2.SetUnreachableAndUpdate(Index);
    Assert.IsFalse(grid3X2.AdjacentLinks[1][Index].IsActive);
    grid3X2.SetReachableAndUpdate(Index);
    Assert.IsTrue(grid3X2.AdjacentLinks[1][Index].IsActive);
}
Copy to ClipboardPrint
[Test]
public void CheckClosestNodeIndexGivenPosition()
{
    Assert.AreEqual(0, grid3X2.GetClosestNode(new Vector2D(0.2f, 0.3f)));
    Assert.AreEqual(1, grid3X2.GetClosestNode(new Vector2D(0.6f, 0.0f)));
    Assert.AreEqual(3, grid3X2.GetClosestNode(new Vector2D(0.0f, 1.4f)));
}
Copy to ClipboardPrint
[Test]
public void CheckGetNodes()
{
    Assert.AreEqual(4, grid3X2.GetNode(1, 1).Id);
}
Copy to ClipboardPrint
[Test]
public void TestAllowingDiagonalPaths()
{
    var grid = new MockLevelGraph(3, 2);
    Assert.AreEqual(1, grid.AdjacentLinks[0][0].TargetNode);
    Assert.AreEqual(3, grid.AdjacentLinks[0][1].TargetNode);
    Assert.AreEqual(4, grid.AdjacentLinks[0][2].TargetNode);
    Assert.AreEqual(0, grid.AdjacentLinks[1][0].TargetNode);
    Assert.AreEqual(2, grid.AdjacentLinks[1][1].TargetNode);
    Assert.AreEqual(4, grid.AdjacentLinks[1][2].TargetNode);
    Assert.AreEqual(5, grid.AdjacentLinks[1][3].TargetNode);
    Assert.AreEqual(3, grid.AdjacentLinks[1][4].TargetNode);
    Assert.AreEqual(1, grid.AdjacentLinks[2][0].TargetNode);
    Assert.AreEqual(5, grid.AdjacentLinks[2][1].TargetNode);
    Assert.AreEqual(4, grid.AdjacentLinks[2][2].TargetNode);
}
Copy to ClipboardPrint
[Test]
public void CheckUpdateWeightInLinks()
{
    grid3X2.UpdateWeightInAdjacentNodes(new Vector2D(0, 1), 1, 10);
    Assert.AreEqual(20, grid3X2.AdjacentLinks[1][0].Costs);
    Assert.AreEqual(10, grid3X2.AdjacentLinks[1][1].Costs);
    Assert.AreEqual(20, grid3X2.AdjacentLinks[1][2].Costs);
    grid3X2.ResetGraph();
    foreach(var links in grid3X2.AdjacentLinks)
        foreach (var link in links)
            Assert.IsTrue(link.IsActive);
}
See Also
DeltaEngine.GameLogic.PathFinding.Tests Namespace