diff options
| -rw-r--r-- | Doc/library/heapq.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index a6b9ba2710..fcaf28d668 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -16,7 +16,7 @@ as the priority queue algorithm. .. seealso:: Latest version of the `heapq Python source code - <http://svn.python.org/view/python/branches/release27-maint/Lib/heapq.py?view=markup>`_ + <http://svn.python.org/view/*checkout*/python/branches/release27-maint/Lib/heapq.py?content-type=text%2Fplain>`_ 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 |