def testDeleteEdge(self):
t = BurchGraphAdjMatrix()
t.addNode(1)
t.addEdge(1,2)
t.deleteEdge(1,2)
self.assertEqual(t.payloads,{1:None,2:None})
self.assertEqual(t.edges,[[1,0],[0,1]])
def testBfs(self): t = BurchGraphAdjMatrix() t.addNode(1) t.addEdge(1,2) t.addEdge(1,3) t.addEdge(1,4) t.addEdge(2,4) t.addEdge(4,5) t.bfs(1)
def testNeighbors(self): t = BurchGraphAdjMatrix() t.addNode(1) t.addEdge(1,2) self.assertEqual(t.neighbors(1),[1,2]) t.addEdge(2,3) t.addEdge(2,4) t.addEdge(2,5) self.assertEqual(t.neighbors(2),[2, 3,4,5])
def testAdjacent(self): t = BurchGraphAdjMatrix() t.addNode(1) t.addEdge(1,2) self.assertEqual(t.adjacent(1,2),True)
def testDeleteMoreEdges(self): t = BurchGraphAdjMatrix() t.addNode(1) t.addEdge(1,2) t.addEdge(2,3) t.addEdge(3,4) t.addEdge(4,5) t.addEdge(5,6) t.addEdge(6,7) t.deleteEdge(2,3) t.deleteEdge(4,5) self.assertEqual(t.edges, [[1, 1, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 1]]) t.addEdge(1,5) t.addEdge(1,7) self.assertEqual(t.edges, [[1, 1, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 1]]) t.deleteEdge(1,5) self.assertEqual(t.edges, [[1, 1, 0, 0, 0, 0, 1], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 1]])
def testAddEdge(self):
t = BurchGraphAdjMatrix()
t.addNode(1)
t.addEdge(1,2)
self.assertEqual(t.payloads,{1:None,2:None})
def testAddNode(self):
x = BurchGraphAdjMatrix()
x.addNode(1)
self.assertIsInstance(x,BurchGraphAdjMatrix)
self.assertEqual(x.payloads,{1: None})
self.assertEqual(x.neighbors(1),[1])
def testCreateAdjListGraph(self): t = BurchGraphAdjMatrix() self.assertIsInstance(t,BurchGraphAdjMatrix)