Graph Search Algorithm

Graph Search Algorithm.py

def graphSearch(problem, strategy):
  start = problem.getStartState()
  explored = set([start[0]])
  strategy.push(start)
  
  while not strategy.empty():
    node = strategy.pop()
    if problem.isGoalState(node):
      return node[1]
    for move in problem.getSuccessors(node):            
      if move[0] not in explored:
        explored.add(move[0])
        strategy.push(move)
  return None