public void TwoGraphWithThreeNodeWithSingleEdgeOneRemoved()
{
Graph g1 = new Graph(1);
Graph g2 = new Graph(2);
Node a = new Node("a");
Node b = new Node("b");
Node c = new Node("c");
Edge ab = new Edge(1);
Edge bc = new Edge(2);
g1.AddNode(a);
g1.AddNode(b);
g1.AddNode(c);
g1.AddUndirectedEdge(new Tuple<Node, int>(a, 0), new Tuple<Node, int>(b, 0), ab);
g1.AddUndirectedEdge(new Tuple<Node, int>(b, 1), new Tuple<Node, int>(c, 0), bc);
g1.RemoveUndirectedEdge(b, c);
g2.AddNode(a);
g2.AddNode(b);
g2.AddNode(c);
g1.AddUndirectedEdge(new Tuple<Node, int>(a, 0), new Tuple<Node, int>(b, 0), ab);
g1.AddUndirectedEdge(new Tuple<Node, int>(b, 1), new Tuple<Node, int>(c, 0), bc);
g2.RemoveUndirectedEdge(b, c);
Assert.IsFalse(g1.Equals(g2));
}