public void CheckIfDFSIsCorrect()
{
var vertices = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
var graph = new DirectedWeightedALGraph <int, int>();
graph.AddVertices(vertices);
// Graph is:
// 1 -> 3, 4
// 1 <- 2
// 2 -> 1, 5
// 2 <- 3, 5, 6
// 3 -> 2, 6
// 3 <- 1, 4
// 4 -> 3, 6
// 4 <- 1, 7
// 5 -> 2, 7, 8
// 5 <- 2, 8
// 6 -> 2
// 6 <- 3, 4
// 7 -> 4
// 7 <- 5, 8
// 8 -> 5, 7
// 8 <- 5
// 9 ->
// 9 <-
// With each edge having a weight of the diffrenece between the source and destination vertex (source - destination)
graph.AddEdge(1, 3, -2);
graph.AddEdge(1, 4, -3);
graph.AddEdge(2, 1, 1);
graph.AddEdge(2, 5, -3);
graph.AddEdge(3, 2, 1);
graph.AddEdge(3, 6, -3);
graph.AddEdge(4, 3, 1);
graph.AddEdge(4, 6, -2);
graph.AddEdge(5, 2, 3);
graph.AddEdge(5, 7, -2);
graph.AddEdge(5, 8, -3);
graph.AddEdge(6, 2, 4);
graph.AddEdge(7, 4, 3);
graph.AddEdge(8, 5, 3);
graph.AddEdge(8, 7, 1);
// Expected dfs for vertex 1:
// 1 | 3 | 2 | 5 | 7 | 4 | 6 | 8
var dfsExpectedOutput = new int[] { 1, 3, 2, 5, 7, 4, 6, 8 };
var dfs = graph.DepthFirstSearch(1).ToList();
Assert.IsTrue(dfs.Count == dfsExpectedOutput.Length);
for (int i = 0; i < dfs.Count; i++)
{
Assert.IsTrue(dfs[i] == dfsExpectedOutput[i]);
}
// Expected dfs edges for vertex 1:
// 1 | 3 | 2 | 5 | 7 | 4 | 5
// 3 | 2 | 5 | 7 | 4 | 6 | 8
var dfsExpectedSources = new int[] { 1, 3, 2, 5, 7, 4, 5 };
var dfsExpectedDestinations = new int[] { 3, 2, 5, 7, 4, 6, 8 };
var dfsEdges = graph.DepthFirstSearchEdges(1).ToList();
Assert.IsTrue(dfsEdges.Count == dfsExpectedSources.Length);
for (int i = 0; i < dfsEdges.Count; i++)
{
Assert.IsTrue(dfsEdges[i].Source == dfsExpectedSources[i]);
Assert.IsTrue(dfsEdges[i].Destination == dfsExpectedDestinations[i]);
Assert.IsTrue(dfsEdges[i].Weight == dfsEdges[i].Source - dfsEdges[i].Destination);
}
// Expected dfs for vertex 8:
// 8 | 5 | 2 | 1 | 3 | 6 | 4 | 7
dfsExpectedOutput = new int[] { 8, 5, 2, 1, 3, 6, 4, 7 };
dfs = graph.DepthFirstSearch(8).ToList();
Assert.IsTrue(dfs.Count == dfsExpectedOutput.Length);
for (int i = 0; i < dfs.Count; i++)
{
Assert.IsTrue(dfs[i] == dfsExpectedOutput[i]);
}
// Expected dfs edges for vertex 8:
// 8 | 5 | 2 | 1 | 3 | 1 | 5
// 5 | 2 | 1 | 3 | 6 | 4 | 7
dfsExpectedSources = new int[] { 8, 5, 2, 1, 3, 1, 5 };
dfsExpectedDestinations = new int[] { 5, 2, 1, 3, 6, 4, 7 };
dfsEdges = graph.DepthFirstSearchEdges(8).ToList();
Assert.IsTrue(dfsEdges.Count == dfsExpectedSources.Length);
for (int i = 0; i < dfsEdges.Count; i++)
{
Assert.IsTrue(dfsEdges[i].Source == dfsExpectedSources[i]);
Assert.IsTrue(dfsEdges[i].Destination == dfsExpectedDestinations[i]);
Assert.IsTrue(dfsEdges[i].Weight == dfsEdges[i].Source - dfsEdges[i].Destination);
}
}
