public void CheckIfIncomingEdgesAreCorrect()
{
var vertices = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
var graph = new WeightedALGraph <int, int>();
graph.AddVertices(vertices);
// Graph is:
// 1 <-> 2, 3, 4
// 2 <-> 1, 3, 5, 6
// 3 <-> 1, 2, 6
// 4 <-> 1, 6, 7
// 5 <-> 2, 7, 8
// 6 <-> 2, 3, 4
// 7 <-> 4, 8
// 8 <-> 7, 5
// 9 <->
// With each edge having a weight of the sum of its vertices
graph.AddEdge(1, 2, 3);
graph.AddEdge(1, 3, 4);
graph.AddEdge(1, 4, 5);
graph.AddEdge(2, 3, 5);
graph.AddEdge(2, 5, 7);
graph.AddEdge(2, 6, 8);
graph.AddEdge(3, 6, 9);
graph.AddEdge(4, 6, 10);
graph.AddEdge(4, 7, 11);
graph.AddEdge(5, 7, 12);
graph.AddEdge(5, 8, 13);
graph.AddEdge(7, 8, 15);
// Vertex 1 expected incoming edges: 2 3 4
var expected = new int[] { 2, 3, 4 };
var edges = graph.IncomingEdgesSorted(1).ToList();
Assert.IsTrue(edges.Count == expected.Length);
for (int i = 0; i < expected.Length; i++)
{
Assert.IsTrue(edges[i].Source == expected[i]);
Assert.IsTrue(edges[i].Weight == edges[i].Source + edges[i].Destination);
}
// Vertex 2 expected incoming edges: 1 3 5 6
expected = new int[] { 1, 3, 5, 6 };
edges = graph.IncomingEdgesSorted(2).ToList();
Assert.IsTrue(edges.Count == expected.Length);
for (int i = 0; i < expected.Length; i++)
{
Assert.IsTrue(edges[i].Source == expected[i]);
Assert.IsTrue(edges[i].Weight == edges[i].Source + edges[i].Destination);
}
// Vertex 7 expected incoming edges: 4 5 8
expected = new int[] { 4, 5, 8 };
edges = graph.IncomingEdgesSorted(7).ToList();
Assert.IsTrue(edges.Count == expected.Length);
for (int i = 0; i < expected.Length; i++)
{
Assert.IsTrue(edges[i].Source == expected[i]);
Assert.IsTrue(edges[i].Weight == edges[i].Source + edges[i].Destination);
}
}