public void BFSSearchTest_GraphInExpertSystem_Simple()
{
//arrange
var g = new AdjacencyMatrixGraph(true, 11);
g.AddEdge(0, 1);
g.AddEdge(0, 2);
g.AddEdge(0, 3);
g.AddEdge(1, 6);
g.AddEdge(2, 5);
g.AddEdge(3, 4);
g.AddEdge(4, 8);
g.AddEdge(4, 9);
g.AddEdge(5, 8);
g.AddEdge(5, 9);
g.AddEdge(6, 8);
g.AddEdge(6, 9);
g.AddEdge(7, 8);
g.AddEdge(7, 9);
g.AddEdge(8, 10);
g.AddEdge(9, 10);
var test = new BestAllocationFinder(g);
////act
var prev = test.BFS(0, 3, g);
//assert
prev.ShouldAllBeEquivalentTo(new int[] { -1, 0, 0, 0, 3, 2, 1, -2, 6, 6, 8 });
}
public void BFSSearchTest_CycleInGraph()
{
//arange
var g = new AdjacencyMatrixGraph(true, 4);
g.AddEdge(3, 0);
g.AddEdge(0, 1);
g.AddEdge(1, 2);
g.AddEdge(2, 3);
var test = new BestAllocationFinder(g);
//act
var prev = test.BFS(0, 3, g);
//assert
prev.ShouldAllBeEquivalentTo(new int[] { -1, 0, 1, 2 });
}
public void BSFSearchTest_TwoPathsWithSameLength()
{
var g = new AdjacencyMatrixGraph(true, 6);
g.AddEdge(0, 1);
g.AddEdge(1, 2);
g.AddEdge(2, 3);
g.AddEdge(0, 5);
g.AddEdge(5, 4);
g.AddEdge(4, 3);
var test = new BestAllocationFinder(g);
////act
var prev = test.BFS(0, 3, g);
//assert
prev.ShouldAllBeEquivalentTo(new int[] { -1, 0, 1, 2, 5, 0 });
}
