Uniform Cost Search Algorithm

Uniform Cost Search Algorithm.py

import heapq
class PriorityQueue:
  def __init__(self, priorityFunction):
    self.priorityFunction = priorityFunction
    self.heap = []
      
  def push(self, item):
    heapq.heappush(self.heap, (self.priorityFunction(item), item))
      
  def pop(self):
    (_, item) = heapq.heappop(self.heap)
    return item
  
  def empty(self):
    return len(self.heap) == 0

def uniformCostSearch(problem):
  return graphSearch(problem, PriorityQueue(lambda state: len(state[1])))