public void ConnectAgain()
{
var vertex = new AdjencyListVertex <int>(0);
var vertex2 = new AdjencyListVertex <int>(-1);
vertex.Connect(vertex2);
vertex.Connect(vertex2);
}
public void AddExisting()
{
var graph = new SimplestListGraph <string>();
var v1 = new AdjencyListVertex <string>("A");
graph.Add(v1);
graph.Add(v1);
}
public void ConnectNotIncluded()
{
var graph = new SimplestListGraph <string>();
var v1 = new AdjencyListVertex <string>("A");
var v2 = new AdjencyListVertex <string>("B");
graph.Add(v1);
graph.Connect(v1, v2);
}
public void ConnectingItself()
{
var graph = new SimplestListGraph <string>();
var v1 = new AdjencyListVertex <string>("A");
var v2 = new AdjencyListVertex <string>("B");
graph.Add(v1);
graph.Add(v2);
Assert.AreEqual(2, graph.VerticesCount);
graph.Connect(v1, v1);
}
public void Adding()
{
var graph = new SimplestListGraph <string>();
var v = new AdjencyListVertex <string>("A");
var v2 = new AdjencyListVertex <string>("B");
var v3 = new AdjencyListVertex <string>("C");
graph.Add(v);
graph.Add(v2);
graph.Add(v3);
Assert.AreEqual(3, graph.VerticesCount);
graph.Connect(v, v2);
}
public void EmptyVertex()
{
var vertex = new AdjencyListVertex <double>(1.3);
var vertex2 = new AdjencyListVertex <double>(1);
Assert.AreEqual(1.3, vertex.Value);
Assert.AreEqual(0, vertex.Count());
Assert.AreEqual(0, vertex.Neighbors().Count());
Assert.IsNull(vertex.GetEnumerator().Current);
Assert.IsFalse(vertex.IsAdjacent(vertex2));
var iterator = vertex.GetEnumerator();
while (iterator.MoveNext())
{
Assert.Fail();
}
}
public void ConnectHimself()
{
var vertex = new AdjencyListVertex <int>(0);
vertex.Connect(vertex);
}
public void ConnectNull()
{
var vertex = new AdjencyListVertex <int>(0);
vertex.Connect(null);
}
