util.PriorityQueue Class Reference

Inheritance diagram for util.PriorityQueue:

Public Member Functions
def	__init__ (self)
def	push (self, item, priority)
def	pop (self)
def	isEmpty (self)

Public Attributes
	heap

Detailed Description

  Implements a priority queue data structure. Each inserted item
  has a priority associated with it and the client is usually interested
  in quick retrieval of the lowest-priority item in the queue. This
  data structure allows O(1) access to the lowest-priority item.
  
  Note that this PriorityQueue does not allow you to change the priority
  of an item.  However, you may insert the same item multiple times with
  different priorities.

---

The documentation for this class was generated from the following file:

• util.py