def dft (self, array): stack = stack () besucht = set () stack.append (self) während len (stack)> 0 und während len (besucht)> = 0: current = stack.pop () Array. append (aktuell) besucht.add (aktuell) Rückgabearray
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