public static void ContainsEdgeAssertions(
[NotNull] IUndirectedGraph <int, IEdge <int> > graph,
[NotNull] IEdge <int> e12,
[NotNull] IEdge <int> f12,
[CanBeNull] IEdge <int> e21,
[CanBeNull] IEdge <int> f21)
{
Assert.AreEqual(1, graph.AdjacentDegree(1));
Assert.AreEqual(1, graph.AdjacentDegree(2));
Assert.AreEqual(1, graph.AdjacentEdges(1).Count());
Assert.AreEqual(1, graph.AdjacentEdges(2).Count());
// e12 must be present in u, because we added it.
Assert.IsTrue(graph.ContainsEdge(e12));
// f12 is also in u, because e12 == f12.
Assert.IsTrue(graph.ContainsEdge(f12));
// e21 and f21 are not in u, because ContainsEdge has semantics that
// if it returns true for an edge, that edge must be physically present in
// the collection of edges inside u.
if (e21 != null)
{
Assert.IsFalse(graph.ContainsEdge(e21));
}
if (f21 != null)
{
Assert.IsFalse(graph.ContainsEdge(f21));
}
// There must be an edge between vertices 1, 2.
Assert.IsTrue(graph.ContainsEdge(1, 2));
// There is also an edge between vertices 2, 1, because the graph is undirected.
Assert.IsTrue(graph.ContainsEdge(2, 1));
// Obviously no edge between vertices 1, 3, as vertex 3 is not even present in the graph.
Assert.IsFalse(graph.ContainsEdge(1, 3));
}
public static void ContainsEdgeAssertions(IUndirectedGraph<int, IEdge<int>> g,
IEdge<int> e12,
IEdge<int> f12,
IEdge<int> e21,
IEdge<int> f21)
{
Assert.AreEqual(1, g.AdjacentDegree(1));
Assert.AreEqual(1, g.AdjacentDegree(2));
Assert.AreEqual(1, g.AdjacentEdges(1).Count());
Assert.AreEqual(1, g.AdjacentEdges(2).Count());
// e12 must be present in u, because we added it.
Assert.IsTrue(g.ContainsEdge(e12));
// f12 is also in u, because e12 == f12.
Assert.IsTrue(g.ContainsEdge(f12));
// e21 and f21 are not in u, because ContainsEdge has semantics that
// if it returns true for an edge, that edge must be physically present in
// the collection of edges inside u.
if (e21 != null) Assert.IsFalse(g.ContainsEdge(e21));
if (f21 != null) Assert.IsFalse(g.ContainsEdge(f21));
// there must be an edge between vertices 1, 2.
Assert.IsTrue(g.ContainsEdge(1, 2));
// there is also an edge between vertices 2, 1, because the graph is undirected.
Assert.IsTrue(g.ContainsEdge(2, 1));
// obviously no edge between vertices 1, 3, as vertex 3 is not even present in the graph.
Assert.IsFalse(g.ContainsEdge(1, 3));
}
