“def dft (self, array): stack = stack =) visité = set () stack.append (self) while Len (pile)” Réponses codées

def dft (self, array): stack = stack =) visité = set () stack.append (self) while Len (pile)> 0 et while Len (visité)> = 0: current = stack.pop () array. Ajouter (actuel) visité.add (actuel) Retourte

def dft(self, array):
    stack = Stack()
    visited = set()
    stack.append(self)
    while len(stack) > 0 and while len(visited) >= 0:
        current = stack.pop()
        array.append(current)
        visited.add(current)
    return array