def dft (self, array): stack = stack () visited = set () stack.append (self) sementara len (stack)> 0 dan sementara len (dikunjungi)> = 0: arus = stack.pop () array. append (saat ini) visited.add (saat ini) pengembalian array
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