public void SetUp() { root = new DirectedGraphNode <int>(21); var n1 = new DirectedGraphNode <int>(14); var n2 = new DirectedGraphNode <int>(18); var n3 = new DirectedGraphNode <int>(39); var n4 = new DirectedGraphNode <int>(51); var n5 = new DirectedGraphNode <int>(63); var n6 = new DirectedGraphNode <int>(16); var n7 = new DirectedGraphNode <int>(27); var n8 = new DirectedGraphNode <int>(84); var n9 = new DirectedGraphNode <int>(30); var n10 = new DirectedGraphNode <int>(33); var n11 = new DirectedGraphNode <int>(36); var n12 = new DirectedGraphNode <int>(11); root.AddNeighbor(n1); root.AddNeighbor(n2); root.AddNeighbor(n3); n1.AddNeighbor(n4); n2.AddNeighbor(n1); n2.AddNeighbor(n5); n3.AddNeighbor(n6); n3.AddNeighbor(n7); n5.AddNeighbor(n8); n6.AddNeighbor(n8); n6.AddNeighbor(n12); n7.AddNeighbor(n9); n9.AddNeighbor(n10); n10.AddNeighbor(n11); }
public void DirectedGraphNode_Equals_WithNeighbors_UnequalNeighborValue() { var n1 = new DirectedGraphNode <int>(10); var n2 = new DirectedGraphNode <int>(10); var n3 = new DirectedGraphNode <int>(20); var n4 = new DirectedGraphNode <int>(30); var n5 = new DirectedGraphNode <int>(40); n1.AddNeighbor(n3); n1.AddNeighbor(n4); n2.AddNeighbor(n3); n2.AddNeighbor(n5); Assert.IsFalse(n1.Equals(n2)); }
public void DirectedGraphNode_Equals_WithNeighbors_UnequalLengths() { var n1 = new DirectedGraphNode <int>(10); var n2 = new DirectedGraphNode <int>(100); var n3 = new DirectedGraphNode <int>(30); var n4 = new DirectedGraphNode <int>(60); var n5 = new DirectedGraphNode <int>(70); var n6 = new DirectedGraphNode <int>(80); n1.AddNeighbor(n2); n1.AddNeighbor(n3); n3.AddNeighbor(n4); n4.AddNeighbor(n5); n4.AddNeighbor(n6); var n7 = new DirectedGraphNode <int>(10); n7.AddNeighbor(n3); Assert.IsFalse(n1.Equals(n7)); }