A simple PriorityQueue in Python

priority_queue.py

class PriorityQueue(object):

  def __init__(self):
    self.store = {}

  def enq(self, element, weight):
    if weight in self.store:
      self.store[weight].append(element)
    else:
      self.store[weight] = [element]

  def deq(self):
    if len(self.store.keys()) == 0:
      return None
    max_weight = sorted(self.store.keys())[-1]
    element = self.store[max_weight].pop(0)
    if len(self.store[max_weight]) == 0:
      del self.store[max_weight]
    return element