Задача о рюкзаке методом ПОИСКА ПО ШИРИНЕ python

import time
start = time.time()
from queue import Queue
from queue import LifoQueue
from copy import copy
class Uzel:
    def __init__(self,id,ben,weight,ben1,weight1):
        self.id = id
        self.ben = ben
        self.weight =  weight
        self.ben1 = ben1
        self.weight1 = weight1
id = []
ben = 0
weight = 0
ben1 = 0
weight1 = 0
class Solution:
    def __init__(self,id, ben, weight):
        self.id = id
        self.fb = ben
        self.fw = weight
id = []
ben = 0
weight = 0
das = Solution(id, ben, weight)
def BFS():
    items=[[20, 15], [40, 32], [50, 60], [36, 80], [26, 43], [64, 120], [54, 77], [18, 6], [46, 93], [28, 35], [25, 37]]
    forcheck = []
    for i in range(0,len(items)):
        forcheck.append(-1)
    ocher = Uzel(forcheck, 0, 0, 0, 0)
    queue = Queue()
    queue.put(ocher)
    depth = len(items)
    while queue.empty()==False:
        node = queue.get()
        if is_solution(node):
            for i in range (0, len(forcheck)):
                if node.id[i] == -1:
                    depth = i
            mweight=420
            if (node.weight1+items[depth][1]) <= mweight:
                ord = copy(node.id)
                ord[depth] = 0
                bala = Uzel(ord, items[depth][0], items[depth][1], node.ben1, node.weight1)
                queue.put(bala)
                solution_1 = copy(node.id)
                solution_1[depth] = 1
                bala = Uzel(solution_1, items[depth][0], items[depth][1], node.ben1 + items[depth][0], node.weight1 + items[depth][1])
                queue.put(bala)
        if das.fb < node.ben1:
            das.id = node.id
            das.fb = node.ben1
            das.fw = node.weight1
        final = []
        sol = das.id
        for i in range (0, len(sol)):
            if sol[i] == 1:
                final.append(i+1)
    print(final, das.fb, das.fw)
def is_solution(node):
    for i in range (0, len(node.id)):
        if node.id[i] == -1:
            return True
    return False
print("BFS:")
BFS()
print("DFS:")
DFS()
end = time.time()
print(end - start)