public void GetPathsTest()
{
PrivateObject param0 = null;
ShortestPath_Accessor target = new ShortestPath_Accessor(param0);
string source = string.Empty;
Node node = null;
List<List<Edge>> edges = null;
int level = 0;
target.GetPaths(source, node, edges, level);
}
public void CreateTreeTest()
{
//Arrange
IEnumerable<Edge> edges = new Edge[4]
{
new Edge{Start="a",End="b",Cost=1},
new Edge{Start="b",End="c",Cost=1000},
new Edge{Start="c",End="d",Cost=1},
new Edge{Start="d",End="a",Cost=100},
};
ShortestPath_Accessor target = new ShortestPath_Accessor(edges);
//Act
Dictionary<string, Node> tree = target.CreateMatrix(edges);
//Assert
Assert.AreEqual(2, tree["a"].Neighbors.Count);
}
public void GetMinimumNodeTest()
{
//Arrange
IEnumerable<Edge> edges = new Edge[4]
{
new Edge{Start="a",End="b",Cost=1},
new Edge{Start="b",End="c",Cost=1000},
new Edge{Start="c",End="d",Cost=1},
new Edge{Start="d",End="a",Cost=100},
};
PrivateObject param0 = new PrivateObject(edges); ;
ShortestPath_Accessor target = new ShortestPath_Accessor(param0);
target._visitedNodes = new HashSet<Node>(); ;
Node expected = null;
//Act
Node actual = target.GetMinimumNode();
//Assert
Assert.AreEqual(expected, actual);
}
public void RelaxNeighboringNodesTest()
{
PrivateObject param0 = null;
ShortestPath_Accessor target = new ShortestPath_Accessor(param0);
Node currentNode = null;
IEnumerable<Node> unVisitedNeighbors = null;
target.RelaxNeighboringNodes(currentNode, unVisitedNeighbors);
}
public void GetUnVisitedNeighborsTest()
{
PrivateObject param0 = null;
ShortestPath_Accessor target = new ShortestPath_Accessor(param0);
target._visitedNodes = null;
Node currentNode = null;
IEnumerable<Node> expected = null;
IEnumerable<Node> actual;
actual = target.GetUnVisitedNeighbors(currentNode);
Assert.AreEqual(expected, actual);
}
