Def dft (self, array): stack = stack () visited = set () stack.append (self) while Len (pila)> 0 y mientras Len (visitado)> = 0: corriente = stack.pop () matriz. append (actual) visitado.Add (actual) matriz de retorno
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
Handsome Hummingbird