wilderfield

  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

wilderfield

  def dfsRecursive(node,visited=set()):
                                            
    visited.add(node)                       
    # Process this node here                    

    for neighbor in getNeighbors(node):
      if neighbor not in visited:           
        dfsRecursive(neighbor,visited)
        
    return