public void BFS_Graph_WithCrossEdges()
{
var graph = new Graph <string, string>();
graph.AddEdges(new List <VertexLink <string, string> >
{
new VertexLink <string, string>("A", "B"),
new VertexLink <string, string>("A", "C"),
new VertexLink <string, string>("A", "D"),
new VertexLink <string, string>("B", "E"),
new VertexLink <string, string>("B", "C"),
new VertexLink <string, string>("D", "C"),
new VertexLink <string, string>("C", "F"),
new VertexLink <string, string>("E", "F"),
});
var bfsTraverser = new BreadthFirstTraverser <string, string>();
var traversedVertices = bfsTraverser.Traverse(graph, "A").ToList();
Assert.AreEqual(6, traversedVertices.Count, "Traversed vertices does not match");
Assert.AreEqual("A", traversedVertices[0], "A does not match");
Assert.AreEqual("B", traversedVertices[1], "B does not match");
Assert.AreEqual("C", traversedVertices[2], "C does not match");
Assert.AreEqual("D", traversedVertices[3], "D does not match");
Assert.AreEqual("E", traversedVertices[4], "E does not match");
Assert.AreEqual("F", traversedVertices[5], "F does not match");
}
public void BFS_TreeGraph()
{
// Given
var graph = new Graph <string, string>();
graph.AddEdges(new List <VertexLink <string, string> >
{
new VertexLink <string, string>("A", "B"),
new VertexLink <string, string>("A", "C"),
new VertexLink <string, string>("A", "D"),
new VertexLink <string, string>("B", "E"),
new VertexLink <string, string>("B", "F"),
new VertexLink <string, string>("C", "G"),
new VertexLink <string, string>("C", "H"),
new VertexLink <string, string>("D", "I"),
new VertexLink <string, string>("F", "J"),
new VertexLink <string, string>("G", "K"),
new VertexLink <string, string>("K", "L"),
});
// When graph is breadth first traveresed
var bfsTraverser = new BreadthFirstTraverser <string, string>();
var traversedVertices = bfsTraverser.Traverse(graph, "A").ToList();
// Then traverse order is
Assert.AreEqual(12, traversedVertices.Count, "Traversed vertices does not match");
Assert.AreEqual("A", traversedVertices[0], "A does not match");
Assert.AreEqual("B", traversedVertices[1], "B does not match");
Assert.AreEqual("C", traversedVertices[2], "C does not match");
Assert.AreEqual("D", traversedVertices[3], "D does not match");
Assert.AreEqual("E", traversedVertices[4], "E does not match");
Assert.AreEqual("F", traversedVertices[5], "F does not match");
Assert.AreEqual("G", traversedVertices[6], "G does not match");
Assert.AreEqual("H", traversedVertices[7], "H does not match");
Assert.AreEqual("I", traversedVertices[8], "I does not match");
Assert.AreEqual("J", traversedVertices[9], "J does not match");
Assert.AreEqual("K", traversedVertices[10], "K does not match");
Assert.AreEqual("L", traversedVertices[11], "L does not match");
}
public void BFS_Graph_WithBackEdge()
{
// Given
var graph = new Graph <string, string>();
graph.AddEdges(new List <VertexLink <string, string> >
{
new VertexLink <string, string>("A", "B"),
new VertexLink <string, string>("A", "C"),
new VertexLink <string, string>("B", "D"),
new VertexLink <string, string>("D", "A"),
});
// When
var bfsTraverser = new BreadthFirstTraverser <string, string>();
var traversedVertices = bfsTraverser.Traverse(graph, "A").ToList();
// Then
Assert.AreEqual(4, traversedVertices.Count, "Traversed vertices does not match");
Assert.AreEqual("A", traversedVertices[0], "A does not match");
Assert.AreEqual("B", traversedVertices[1], "B does not match");
Assert.AreEqual("C", traversedVertices[2], "C does not match");
Assert.AreEqual("D", traversedVertices[3], "D does not match");
}