public void ContainsVertex()
{
DirectedGraph <string, int> graph = new DirectedGraph <string, int>();
graph.AddVertex("A");
graph.AddVertex("B");
Assert.IsTrue(graph.ContainsVertex("A"));
Assert.IsFalse(graph.ContainsVertex("bla"));
}
public void TestVertexAdd()
{
var graph = new DirectedGraph <string>();
var v1 = "One";
var actual1 = graph.ContainsVertex(v1);
Assert.AreEqual(false, actual1);
graph.AddVertex(v1);
var actual2 = graph.ContainsVertex(v1);
Assert.AreEqual(true, actual2);
}
public void ContainsVertex_ShouldUseCustomComparer()
{
var graph = new DirectedGraph <string>(StringComparer.OrdinalIgnoreCase);
graph.AddVertex("A");
graph.ContainsVertex("a").Should().BeTrue();
}
public void TestContainsWithEmptyGraph()
{
const int Vertex = 0;
var sut = new DirectedGraph <int>();
Check.That(sut.ContainsVertex(Vertex)).IsFalse();
}
public void TestAddContainsVertex()
{
const int Vertex = 0;
var sut = new DirectedGraph <int>();
Check.That(sut.AddVertex(Vertex)).IsTrue();
Check.That(sut.ContainsVertex(Vertex)).IsTrue();
}
public void TestAddContainsMultipleVertices()
{
var vertices = new[] { 0, 1, 2, 3 };
var sut = new DirectedGraph <int>();
sut.AddVertices(vertices);
foreach (var vertex in vertices)
{
Check.That(sut.ContainsVertex(vertex)).IsTrue();
}
Check.That(sut.Vertices).IsEquivalentTo(vertices);
}
