public void One_Node_In_Graph_Returns_Valid_Path_Of_Length_One()
{
var graph = new GraphNode<int> {Value = 1};
var walker = new GraphWalker<int>(graph);
var path = walker.TraverseTo(1);
Assert.AreEqual(true, path.IsValid);
Assert.AreEqual(1, path.Count(), "Path length should be one (node) for single node graph");
}
public void Transition_Document_Graph_Is_Walkable()
{
var document = XDocument.Load(TransitionDocument);
var builder = new WorkItemStateGraphBuilder();
var graph = builder.BuildStateGraph(document);
var walker = new GraphWalker<string>(graph);
var walkingPath = walker.TraverseTo("Closed");
Assert.IsNotNull(walkingPath);
}
public void Search_Result_Is_Walkable()
{
var document = XDocument.Load(TransitionDocument);
var builder = new WorkItemStateGraphBuilder();
var graph = builder.BuildStateGraph(document);
var node = graph.Find("Failed Testing");
var walker = new GraphWalker<string>(node);
var walk = walker.TraverseTo("Closed");
Assert.IsNotNull(walk);
}
public void Three_Nodes_In_Tree_Graph_Returns_Valid_Path_With_Length_Of_Two()
{
var graphRoot = new GraphNode<int> {Value = 1};
var secondNode = new GraphNode<int> {Value = 2};
var thirdNode = new GraphNode<int> {Value = 3};
graphRoot.Add(secondNode);
graphRoot.Add(thirdNode);
var walker = new GraphWalker<int>(graphRoot);
var path = walker.TraverseTo(3);
Assert.AreEqual(true, path.IsValid);
Assert.AreEqual(2, path.Count(), "Path length should be two (nodes) for three node tree graph");
}
public void Five_Nodes_In_A_Graph_Returns_Valid_Path_With_Length_Of_Three()
{
var graphRoot = new GraphNode<int> {Value = 1};
var secondNode = new GraphNode<int> {Value = 2};
var thirdNode = new GraphNode<int> {Value = 3};
var fourthNode = new GraphNode<int> {Value = 4};
var fifthNode = new GraphNode<int> {Value = 5};
//first level
graphRoot.Add(secondNode);
graphRoot.Add(thirdNode);
//second level
thirdNode.Add(fourthNode);
secondNode.Add(fifthNode);
fourthNode.Add(graphRoot);
var walker = new GraphWalker<int>(graphRoot);
var path = walker.TraverseTo(5);
Assert.AreEqual(true, path.IsValid);
Assert.AreEqual(3, path.Count(), "Path length should be three (nodes) for six node graph");
}
public void Two_Paths_To_Target_Returns_Shortest_Valid_Path()
{
var graphRoot = new GraphNode<int> {Value = 1};
var secondNode = new GraphNode<int> {Value = 2};
var thirdNode = new GraphNode<int> {Value = 3};
var fourthNode = new GraphNode<int> {Value = 4};
var fifthNode = new GraphNode<int> {Value = 5};
graphRoot.Add(secondNode);
graphRoot.Add(thirdNode);
secondNode.Add(fourthNode);
thirdNode.Add(fifthNode);
fourthNode.Add(fifthNode);
var walker = new GraphWalker<int>(graphRoot);
var path = walker.TraverseTo(5);
Assert.AreEqual(true, path.IsValid);
Assert.AreEqual(3, path.Count(), "Path length should be three (nodes) for five node graph");
}
public void Value_Not_In_Graph_Throws_Arg_Out_Of_Range()
{
var graphRoot = new GraphNode<int> {Value = 1};
var secondNode = new GraphNode<int> {Value = 2};
var thirdNode = new GraphNode<int> {Value = 3};
graphRoot.Add(secondNode);
graphRoot.Add(thirdNode);
var walker = new GraphWalker<int>(graphRoot);
var exceptional = false;
try
{
walker.TraverseTo(5);
}
catch (ArgumentOutOfRangeException ex)
{
exceptional = true;
Assert.AreEqual(5, ex.ActualValue);
Assert.AreEqual("value", ex.ParamName);
}
Assert.IsTrue(exceptional, "Expected to catch an argument out of range exception");
}