public void RemoveEdgeTest()
{
var g = new EdgeListGraph <int, EquatableEdge <int> >(true, false);
EquatableEdge <int> e = new EquatableEdge <int>(0, 1);
g.AddEdge(e);
Assert.IsTrue(g.RemoveEdge(e));
Assert.IsFalse(g.RemoveEdge(e));
}
protected static void RemoveEdge_EdgesOnly_Test(
[NotNull] EdgeListGraph <int, Edge <int> > graph)
{
int edgesRemoved = 0;
// ReSharper disable once ParameterOnlyUsedForPreconditionCheck.Local
graph.EdgeRemoved += e =>
{
Assert.IsNotNull(e);
// ReSharper disable once AccessToModifiedClosure
++edgesRemoved;
};
var edge12 = new Edge <int>(1, 2);
var edge13 = new Edge <int>(1, 3);
var edge13Bis = new Edge <int>(1, 3);
var edge14 = new Edge <int>(1, 4);
var edge24 = new Edge <int>(2, 4);
var edge31 = new Edge <int>(3, 1);
var edge33 = new Edge <int>(3, 3);
var edgeNotInGraph = new Edge <int>(3, 4);
var edgeNotEquatable = new Edge <int>(1, 2);
graph.AddVerticesAndEdgeRange(new[] { edge12, edge13, edge13Bis, edge14, edge24, edge31, edge33 });
Assert.IsFalse(graph.RemoveEdge(edgeNotInGraph));
CheckCounter(0);
Assert.IsFalse(graph.RemoveEdge(edgeNotEquatable));
CheckCounter(0);
Assert.IsTrue(graph.RemoveEdge(edge13Bis));
CheckCounter(1);
AssertHasVertices(graph, new[] { 1, 2, 3, 4 });
AssertHasEdges(graph, new[] { edge12, edge13, edge14, edge24, edge31, edge33 });
Assert.IsTrue(graph.RemoveEdge(edge31));
CheckCounter(1);
AssertHasVertices(graph, new[] { 1, 2, 3, 4 });
AssertHasEdges(graph, new[] { edge12, edge13, edge14, edge24, edge33 });
Assert.IsTrue(graph.RemoveEdge(edge12));
Assert.IsTrue(graph.RemoveEdge(edge13));
Assert.IsTrue(graph.RemoveEdge(edge14));
Assert.IsTrue(graph.RemoveEdge(edge24));
Assert.IsTrue(graph.RemoveEdge(edge33));
CheckCounter(5);
AssertEmptyGraph(graph); // Vertices removed in the same time as edges
#region Local function
void CheckCounter(int expectedRemovedEdges)
{
Assert.AreEqual(expectedRemovedEdges, edgesRemoved);
edgesRemoved = 0;
}
#endregion
}
