dsap.pq.priority_queue_base.PriorityQueueBase

class documentation

class PriorityQueueBase:

Known subclasses: dsap.pq.heap_priority_queue.HeapPriorityQueue, dsap.pq.sorted_priority_queue.SortedPriorityQueue, dsap.pq.unsorted_priority_queue.UnsortedPriorityQueue

View In Hierarchy

Abstract base class for a priority queue.

Method __len__ Return the number of items in the priority queue.
Method add Add a key-value pair.
Method is_empty Return True if the priority queue is empty.
Method min Return but do not remove (k,v) tuple with minimum key.
Method remove_min Remove and return (k,v) tuple with minimum key.
Class _Item Lightweight composite to store priority queue items.
def __len__(self):
overridden in dsap.pq.heap_priority_queue.HeapPriorityQueue, dsap.pq.sorted_priority_queue.SortedPriorityQueue, dsap.pq.unsorted_priority_queue.UnsortedPriorityQueue

Return the number of items in the priority queue.

def add(self, key, value):
overridden in dsap.pq.heap_priority_queue.HeapPriorityQueue, dsap.pq.sorted_priority_queue.SortedPriorityQueue, dsap.pq.unsorted_priority_queue.UnsortedPriorityQueue

Add a key-value pair.

def is_empty(self):

Return True if the priority queue is empty.

def min(self):
overridden in dsap.pq.heap_priority_queue.HeapPriorityQueue, dsap.pq.sorted_priority_queue.SortedPriorityQueue, dsap.pq.unsorted_priority_queue.UnsortedPriorityQueue

Return but do not remove (k,v) tuple with minimum key.

Raise Empty exception if empty.

def remove_min(self):
overridden in dsap.pq.heap_priority_queue.HeapPriorityQueue, dsap.pq.sorted_priority_queue.SortedPriorityQueue, dsap.pq.unsorted_priority_queue.UnsortedPriorityQueue

Remove and return (k,v) tuple with minimum key.

Raise Empty exception if empty.