DFS Iterative

dfsIterative.py

  def dfsIterative(node,visited=set()):
    
    stack = [node]
    
    while stack:  
      node = stack.pop()                  
      if node not in visited:
        visited.add(node)    
        # Process this node here
        for neighbor in reversed(getNeighbors(node)): # Reversal not mandatory
          if neighbor not in visited:           
            stack.append(neighbor)
            
    return