def __init__(self, filename): x = 5000 sys.setrecursionlimit(x) #names, cnf = IO.read_dimacs('SPLOT-3CNF-FM-500-50-1.00-SAT-10') self.items = SATSolver.get_solutions(10000, filename) self.weights = [1] * len(self.items) self.tree = sway(self.items, 100) self.names = [] #names # Weight of top node = 0 # self.tree.weight = 0 self.rank = Ranker.level_rank_features(self.tree, self.weights) self.cur_best_node = Ranker.rank_nodes(self.tree, self.rank) self.questions = IO.get_question_text('terms_sentence_map.csv', 'sentence')
def re_rank(self): self.rank = Ranker.level_rank_features(self.tree, self.weights) self.cur_best_node = Ranker.rank_nodes(self.tree, self.rank)