public void BoggleGraphTest_Add_Node_DoesntAddDupes()
{
BoggleNode node = new BoggleNode(0, 0);
BoggleGraph graph = new BoggleGraph();
graph.Add(node);
Assert.IsTrue(graph.NodeCount == 1);
graph.Add(node);
Assert.IsTrue(graph.NodeCount == 1);
graph.Add(node);
Assert.IsTrue(graph.NodeCount == 1);
}
public void BoggleGraphTest_Contains_Edge_WhenEdgePresent_ReturnsTrue()
{
BoggleEdge edge = new BoggleEdge(new BoggleNode(0, 0), new BoggleNode(1, 0));
BoggleGraph graph = new BoggleGraph();
graph.Add(edge);
Assert.IsTrue(graph.Contains(edge));
}
public void BoggleGraphTest_Contains_Node_WhenNodePresent_ReturnsTrue()
{
BoggleNode node = new BoggleNode(0, 1);
BoggleGraph graph = new BoggleGraph();
graph.Add(node);
Assert.IsTrue(graph.Contains(node));
}
public void BoggleGraphTest_Add_Edge_AddsTheNode()
{
BoggleGraph graph = new BoggleGraph();
Assert.IsTrue(graph.EdgeCount == 0);
graph.Add(new BoggleEdge());
Assert.IsTrue(graph.EdgeCount == 1);
}
public void BoggleGraphTest_Add_Edge_DoesntAddDupes()
{
BoggleEdge edge = new BoggleEdge(new BoggleNode(0, 0), new BoggleNode(1, 0));
BoggleGraph graph = new BoggleGraph();
graph.Add(edge);
Assert.IsTrue(graph.EdgeCount == 1);
graph.Add(edge);
Assert.IsTrue(graph.EdgeCount == 1);
graph.Add(edge);
Assert.IsTrue(graph.EdgeCount == 1);
}
public void BoggleGraphTest_Add_Edge_ReturnsTheGraph()
{
BoggleGraph graph = new BoggleGraph();
Assert.AreEqual(graph, graph.Add(new BoggleEdge()));
}
public void BoggleGraphTest_Equals_ReturnsFalse_WhenGraphsAreUnequal()
{
BoggleGraph g1 = new BoggleGraph();
BoggleGraph g2 = new BoggleGraph();
g1.Add(new BoggleNode());
Assert.AreNotEqual(g1, g2);
g1 = new BoggleGraph();
g1.Add(new BoggleEdge());
Assert.AreNotEqual(g1, g2);
g2.Add(new BoggleEdge(new BoggleNode(0, 1), null));
Assert.AreNotEqual(g1, g2);
}
public void BoggleGraphTest_Equals_ReturnsTrueWhenEquals_RegardlesOfEdgeOrdering()
{
BoggleGraph g1 = new BoggleGraph();
BoggleGraph g2 = new BoggleGraph();
BoggleEdge e1 = new BoggleEdge(new BoggleNode(0, 0), new BoggleNode(1, 0));
BoggleEdge e2 = new BoggleEdge(new BoggleNode(0, 0), new BoggleNode(0, 1));
BoggleEdge e3 = new BoggleEdge(new BoggleNode(1, 0), new BoggleNode(1, 1));
// insert edges out of order to verify that ordering doesn't effect graph equality
g1.Add(e1);
g1.Add(e2);
g1.Add(e3);
g2.Add(e3);
g2.Add(e1);
g2.Add(e2);
Assert.AreEqual(g1, g2);
}
public void BoggleGraphTest_Equals_ReturnsTrueWhenEquals_RegardlesOfNodeOrdering()
{
BoggleGraph g1 = new BoggleGraph();
BoggleGraph g2 = new BoggleGraph();
BoggleNode n1 = new BoggleNode(0, 0);
BoggleNode n2 = new BoggleNode(1, 0);
BoggleNode n3 = new BoggleNode(2, 0);
// insert nodes out of order to verify that ordering doesn't effect graph equality
g1.Add(n1);
g1.Add(n2);
g1.Add(n3);
g2.Add(n3);
g2.Add(n1);
g2.Add(n2);
Assert.AreEqual(g1, g2);
}