def test_clearNodes(self): """Should empty path stack and variable forbidden""" #create a searchpath and add just one node test = SearchPath(SearchPathHelper.alphabets) test.generate(1) #now call clear and make sure path value is "" (empty) test.clearNodes() self.assertEquals(test.Value, "")
def test_generate_correctAlph(self): """Should get correct alphabet even if node is popped then readded""" test_alphs = {0:"A",1:"BC",2:"D",3:"E",SearchPath.DEFAULT_KEY:"X"} forbidden_seqs = ["CD"] test = SearchPath(test_alphs, forbidden_seqs) #given these position alphabets and this forbidden seq, #the only legal 3-node searchpath should be ABD. Make #a hundred searchpaths and make sure this is the only one #that actually shows up. found_paths = {} for i in xrange(100): curr_path = test.generate(3) found_paths[curr_path] = True test.clearNodes() #next #make sure there is only one path found and that it is the right one found_path_str = str("".join(found_paths.keys())) self.assertEquals(len(found_paths), 1) self.assertEquals(found_path_str, "ABD")