Add more links to Python sources where the code is short, readable and an informative adjunct to the docs.
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 6c0e467..b46bd82 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -13,6 +13,11 @@
This module provides an implementation of the heap queue algorithm, also known
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>`_
+
Heaps are arrays for which ``heap[k] <= heap[2*k+1]`` and ``heap[k] <=
heap[2*k+2]`` for all *k*, counting elements from zero. For the sake of
comparison, non-existing elements are considered to be infinite. The