diff options
| author | Raymond Hettinger <python@rcn.com> | 2011-01-10 03:26:08 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2011-01-10 03:26:08 (GMT) |
| commit | 10480940373492652bc285fca3fa74751c271645 (patch) | |
| tree | bb1bfed3416120cc371eb884960cf73aad9a957e /Doc/library/heapq.rst | |
| parent | a4815caa7ccf21aa994d0e0eec66873072f0e352 (diff) | |
| download | cpython-10480940373492652bc285fca3fa74751c271645.zip cpython-10480940373492652bc285fca3fa74751c271645.tar.gz cpython-10480940373492652bc285fca3fa74751c271645.tar.bz2 | |
Move source links to consistent location and remove wordy, big yellow boxes.
Diffstat (limited to 'Doc/library/heapq.rst')
| -rw-r--r-- | Doc/library/heapq.rst | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index f6b14ca..f59c3b8 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -8,14 +8,11 @@ .. sectionauthor:: François Pinard .. sectionauthor:: Raymond Hettinger +**Source code:** :source:`Lib/heapq.py` + This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. -.. seealso:: - - Latest version of the :source:`heapq Python source code - <Lib/heapq.py>` - Heaps are binary trees for which every parent node has a value less than or equal to any of its children. This implementation uses arrays for which ``heap[k] <= heap[2*k+1]`` and ``heap[k] <= heap[2*k+2]`` for all *k*, counting |