A* Tree Search Pseudocode

A* Tree Search Pseudocode.py

def A*-TREE-SEARCH (start):
  Let pq be an empty min priority queue
  
  g(start) = 0
  f(start) = h(start)
  path(start) = []
  pq.push(start, f(start))
  
  while not pq.empty():
    top = pq.pop()
    if isGoal(top):
      return f(top), path(top)
    foreach next in succ(top):
      g(next) = g(top) + cost(top, next)
      f(next) = g(next) + h(next)
      path(next) = path(top).append(next)
      pq.push(next, f(next))