public void CheckIfIncomingEdgesAreCorrect() { 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); // Vertex 1 expected incoming edges: 2 var expected = new int[] { 2 }; 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: 3 5 6 expected = new int[] { 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: 5 8 expected = new int[] { 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); } }