diff -r bd4199049036 -r 4bfe670710e0 lemon/linear_heap.h
--- a/lemon/linear_heap.h	Wed Nov 02 16:43:18 2005 +0000
+++ b/lemon/linear_heap.h	Fri Nov 04 10:51:35 2005 +0000
@@ -162,10 +162,9 @@
       }
     }
 
-    /// \brief Returns the item with minimum priority relative to \c Compare.
+    /// \brief Returns the item with minimum priority.
     ///
-    /// This method returns the item with minimum priority relative to \c
-    /// Compare.  
+    /// This method returns the item with minimum priority.
     /// \pre The heap must be nonempty.  
     Item top() const {
       while (first[minimal] == -1) {
@@ -174,9 +173,9 @@
       return data[first[minimal]].item;
     }
 
-    /// \brief Returns the minimum priority relative to \c Compare.
+    /// \brief Returns the minimum priority.
     ///
-    /// It returns the minimum priority relative to \c Compare.
+    /// It returns the minimum priority.
     /// \pre The heap must be nonempty.
     Prio prio() const {
       while (first[minimal] == -1) {
@@ -185,10 +184,9 @@
       return minimal;
     }
 
-    /// \brief Deletes the item with minimum priority relative to \c Compare.
+    /// \brief Deletes the item with minimum priority.
     ///
-    /// This method deletes the item with minimum priority relative to \c
-    /// Compare from the heap.  
+    /// This method deletes the item with minimum priority from the heap.  
     /// \pre The heap must be non-empty.  
     void pop() {
       while (first[minimal] == -1) {