public void RemovingVerticesAndCheckingIfRemovedProperly()
{
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);
Assert.IsTrue(graph.EdgesCount == 15);
Assert.IsTrue(graph.ContainsVertex(3));
Assert.IsTrue(graph.ContainsEdge(3, 2));
Assert.IsTrue(graph.ContainsEdge(3, 6));
Assert.IsTrue(graph.ContainsEdge(1, 3));
Assert.IsTrue(graph.ContainsEdge(4, 3));
graph.RemoveVertex(3);
Assert.IsFalse(graph.ContainsVertex(3));
Assert.IsFalse(graph.ContainsEdge(3, 2));
Assert.IsFalse(graph.ContainsEdge(3, 6));
Assert.IsFalse(graph.ContainsEdge(1, 3));
Assert.IsFalse(graph.ContainsEdge(4, 3));
Assert.IsTrue(graph.EdgesCount == 11);
Assert.IsTrue(graph.ContainsVertex(5));
Assert.IsTrue(graph.ContainsEdge(5, 2));
Assert.IsTrue(graph.ContainsEdge(5, 7));
Assert.IsTrue(graph.ContainsEdge(5, 8));
Assert.IsTrue(graph.ContainsEdge(2, 5));
Assert.IsTrue(graph.ContainsEdge(8, 5));
graph.RemoveVertex(5);
Assert.IsFalse(graph.ContainsVertex(5));
Assert.IsFalse(graph.ContainsEdge(5, 2));
Assert.IsFalse(graph.ContainsEdge(5, 7));
Assert.IsFalse(graph.ContainsEdge(5, 8));
Assert.IsFalse(graph.ContainsEdge(2, 5));
Assert.IsFalse(graph.ContainsEdge(8, 5));
Assert.IsTrue(graph.EdgesCount == 6);
}