Depth First Search Algorithm

Depth First Search Algorithm.py

class Stack:
  def __init__(self):
    self.stack = []

  def push(self, item):
    self.stack.append(item)

  def pop(self):        
    return self.stack.pop()

  def empty(self):
    return len(self.stack) == 0

def depthFirstTreeSearch(problem):
  return treeSearch(problem, Stack())

def depthFirstGraphSearch(problem):
  return graphSearch(problem, Stack())