heapq.rst

:mod:`heapq` -- heap queue algorithm

|see_cpython_module| :mod:`python:heapq`.

This module implements the min heap queue algorithm.

A heap queue is essentially a list that has its elements stored in such a way that the first item of the list is always the smallest.

Functions