TechBeamers Python: Python Heapq (With Examples)

This tutorial intends to train you on using Python heapq. It is a module in Python which uses the binary heap data structure and implements Heap Queue a.k.a. Priority Queue algorithm. Interestingly, the heapq module uses a regular Python list to create Heap. It supports addition and removal of the smallest element in O(log n) time. Hence, it is an obvious choice for implementing priority queues. The heapq module includes seven functions, the first four of which are used for heap operations. However, you need to provide a list as the heap object itself. Heap data structure has a property

The post Python Heapq (With Examples) appeared first on Learn Programming and Software Testing.

from Planet Python
via read more