public void DirectedGraphTests_GetRootNode_WhereNodeNotExists()
{
List <Node[]> inputMatrix = new List <Node[]>();
DirectedGraph myGraph = new DirectedGraph();
myGraph.BuildGraph(inputMatrix);
Assert.IsNull(myGraph.GetRootNode());
}
public void DirectedGraphTests_SearchMaxPaths_WhereGraphIsEmpty()
{
List <Node[]> inputMatrix = new List <Node[]>();
DirectedGraph myGraph = new DirectedGraph();
myGraph.BuildGraph(inputMatrix);
List <List <Node> > foundPaths = new List <List <Node> >();
myGraph.SearchMaxPaths(myGraph.GetRootNode(), new List <Node>(), foundPaths);
Assert.AreEqual(0, foundPaths.Count);
}
public void DirectedGraphTests_BuildGraph_FromValidInputMatrix()
{
List <Node[]> inputMatrix = new List <Node[]> {
new Node[] { new Node(0) },
new Node[] { new Node(5), new Node(7) },
new Node[] { new Node(10), new Node(20), new Node(30) }
};
DirectedGraph myGraph = new DirectedGraph();
myGraph.BuildGraph(inputMatrix);
Assert.AreEqual(3, myGraph.maxLength);
Assert.AreEqual(6, myGraph.nodes.Count);
}
public void DirectedGraphTests_SearchMaxPaths_WhereSuchPatInOneLineGraph()
{
List <Node[]> inputMatrix = new List <Node[]> {
new Node[] { new Node(0) }
};
DirectedGraph myGraph = new DirectedGraph();
myGraph.BuildGraph(inputMatrix);
List <List <Node> > foundPaths = new List <List <Node> >();
myGraph.SearchMaxPaths(myGraph.nodes[0], new List <Node>(), foundPaths);
Assert.AreEqual(1, foundPaths.Count);
}
public void DirectedGraphTests_SearchMaxPaths_WhereSuchPathIsFound()
{
List <Node[]> inputMatrix = new List <Node[]> {
new Node[] { new Node(0) },
new Node[] { new Node(5), new Node(7) },
new Node[] { new Node(10), new Node(20), new Node(30) }
};
DirectedGraph myGraph = new DirectedGraph();
myGraph.BuildGraph(inputMatrix);
myGraph.PrintGraph();
List <List <Node> > foundPaths = new List <List <Node> >();
myGraph.SearchMaxPaths(myGraph.nodes[0], new List <Node>(), foundPaths);
Assert.AreEqual(4, foundPaths.Count);
}
public void DirectedGraphTests_BuildGraph_FromInValidInputMatrix()
{
List <Node[]> inputMatrix = new List <Node[]> {
new Node[] { new Node(0) },
new Node[] { new Node(5), new Node(7), new Node(8) },
new Node[] { new Node(10), new Node(20), new Node(30) }
};
DirectedGraph myGraph = new DirectedGraph();
try
{
myGraph.BuildGraph(inputMatrix);
Assert.Fail("no exception thrown");
}
catch (Exception ex)
{
Assert.IsTrue(ex is Exception);
}
}
