public void RemovingEdgesAndCheckingIfRemovedProperly()
{
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);
Assert.IsTrue(graph.EdgesCount == 12);
Assert.IsTrue(graph.Degree(3) == 3);
Assert.IsTrue(graph.Degree(6) == 3);
Assert.IsTrue(graph.ContainsEdge(3, 6));
Assert.IsTrue(graph.ContainsEdge(6, 3));
graph.RemoveEdge(3, 6);
Assert.IsFalse(graph.ContainsEdge(3, 6));
Assert.IsFalse(graph.ContainsEdge(6, 3));
Assert.IsTrue(graph.Degree(3) == 2);
Assert.IsTrue(graph.Degree(6) == 2);
Assert.IsTrue(graph.EdgesCount == 11);
Assert.IsTrue(graph.Degree(1) == 3);
Assert.IsTrue(graph.Degree(4) == 3);
Assert.IsTrue(graph.ContainsEdge(1, 4));
Assert.IsTrue(graph.ContainsEdge(4, 1));
graph.RemoveEdge(4, 1);
Assert.IsFalse(graph.ContainsEdge(1, 4));
Assert.IsFalse(graph.ContainsEdge(4, 1));
Assert.IsTrue(graph.Degree(1) == 2);
Assert.IsTrue(graph.Degree(4) == 2);
Assert.IsTrue(graph.EdgesCount == 10);
Assert.IsTrue(graph.Degree(5) == 3);
Assert.IsTrue(graph.Degree(7) == 3);
Assert.IsTrue(graph.ContainsEdge(7, 5));
Assert.IsTrue(graph.ContainsEdge(5, 7));
graph.RemoveEdge(5, 7);
Assert.IsFalse(graph.ContainsEdge(7, 5));
Assert.IsFalse(graph.ContainsEdge(5, 7));
Assert.IsTrue(graph.Degree(5) == 2);
Assert.IsTrue(graph.Degree(7) == 2);
Assert.IsTrue(graph.EdgesCount == 9);
}