1.1 --- a/lemon/concepts/heap.h	Wed Jul 08 17:21:30 2009 +0200
     1.2 +++ b/lemon/concepts/heap.h	Wed Jul 08 17:22:36 2009 +0200
     1.3 @@ -36,7 +36,7 @@
     1.4      /// \brief The heap concept.
     1.5      ///
     1.6      /// This concept class describes the main interface of heaps.
     1.7 -    /// The various heap structures are efficient
     1.8 +    /// The various \ref heaps "heap structures" are efficient
     1.9      /// implementations of the abstract data type \e priority \e queue.
    1.10      /// They store items with specified values called \e priorities
    1.11      /// in such a way that finding and removing the item with minimum