def testGetRoot(self): dictTree = DictTree() dictTree.addEdge("a", "b") dictTree.addEdge("a", "c") dictTree.addEdge("d", "a") self.assertEquals(dictTree.getRootId(), "d") dictTree.addEdge("e", "d") self.assertEquals(dictTree.getRootId(), "e")
def testGetRoot(self): dictTree = DictTree() dictTree.addEdge("a", "b") dictTree.addEdge("a", "c") dictTree.addEdge("d", "a") self.assertEquals(dictTree.getRootId(), "d") dictTree.addEdge("e", "d") self.assertEquals(dictTree.getRootId(), "e")
def testSplitNode(self): d = 0 k = 0 maxDepth = 1 inds = numpy.arange(self.y.shape[0]) treeRank = TreeRank(self.leafRanklearner) treeRank.setMaxDepth(maxDepth) node = RankNode(inds, numpy.arange(self.X.shape[1])) tree = DictTree() tree.setVertex((0, 0), node) tree = treeRank.splitNode(tree, self.X, self.y, d, k) self.assertEquals(tree.getNumVertices(), 3) self.assertEquals(tree.getNumEdges(), 2) self.assertEquals(tree.getRootId(), (0, 0)) self.assertTrue(not tree.getVertex((0, 0)).isLeafNode()) self.assertTrue(tree.getVertex((1, 0)).isLeafNode()) self.assertTrue(tree.getVertex((1, 1)).isLeafNode()) self.assertTrue(tree.depth() <= maxDepth)
def testSplitNode(self): d = 0 k = 0 maxDepth = 1 inds = numpy.arange(self.y.shape[0]) treeRank = TreeRank(self.leafRanklearner) treeRank.setMaxDepth(maxDepth) node = RankNode(inds, numpy.arange(self.X.shape[1])) tree = DictTree() tree.setVertex((0, 0), node) tree = treeRank.splitNode(tree, self.X, self.y, d, k) self.assertEquals(tree.getNumVertices(), 3) self.assertEquals(tree.getNumEdges(), 2) self.assertEquals(tree.getRootId(), (0, 0)) self.assertTrue(not tree.getVertex((0, 0)).isLeafNode()) self.assertTrue(tree.getVertex((1, 0)).isLeafNode()) self.assertTrue(tree.getVertex((1, 1)).isLeafNode()) self.assertTrue(tree.depth() <= maxDepth)