public void DeleteEdgeTest()
{
/*
* A-----B\
* |\ E
* | \ /
* C- D/
*/
Node <string> a = new Node <string>("A");
Node <string> b = new Node <string>("B");
Node <string> c = new Node <string>("C");
Node <string> d = new Node <string>("D");
Node <string> e = new Node <string>("E");
Node <string>[] myNodes = new Node <string>[] {
a, b, c, d, e
};
GraphAdjacentList <string> gh = new GraphAdjacentList <string>(myNodes);
gh.AddEdge(a, b, 1);
gh.AddEdge(a, b, 1);
gh.AddEdge(b, e, 1);
gh.AddEdge(e, d, 1);
gh.AddEdge(d, c, 1);
gh.AddEdge(c, a, 1);
gh.AddEdge(a, d, 1);
Assert.AreEqual(6, gh.GetNumOfEdge());
gh.DeleteEdge(a, e);
Assert.AreEqual(6, gh.GetNumOfEdge());
gh.DeleteEdge(a, b);
Assert.AreEqual(5, gh.GetNumOfEdge());
gh.DeleteEdge(b, e);
Assert.AreEqual(4, gh.GetNumOfEdge());
gh.DeleteEdge(e, d);
Assert.AreEqual(3, gh.GetNumOfEdge());
gh.DeleteEdge(d, c);
Assert.AreEqual(2, gh.GetNumOfEdge());
gh.DeleteEdge(c, a);
Assert.AreEqual(1, gh.GetNumOfEdge());
gh.DeleteEdge(a, d);
Assert.AreEqual(0, gh.GetNumOfEdge());
}
public void GetNumOfEdgeTest()
{
Assert.AreEqual(6, graph.GetNumOfEdge());
}
