1.1 --- a/src/hugo/fib_heap.h	Mon Sep 27 18:11:27 2004 +0000
     1.2 +++ b/src/hugo/fib_heap.h	Tue Sep 28 07:00:58 2004 +0000
     1.3 @@ -35,7 +35,7 @@
     1.4    ///This class implements the \e Fibonacci \e heap data structure. A \e heap
     1.5    ///is a data structure for storing items with specified values called \e
     1.6    ///priorities in such a way that finding the item with minimum priority is
     1.7 -  ///efficient. \ref Compare specifies the ordering of the priorities. In a heap
     1.8 +  ///efficient. \c Compare specifies the ordering of the priorities. In a heap
     1.9    ///one can change the priority of an item, add or erase an item, etc.
    1.10    ///
    1.11    ///The methods \ref increase and \ref erase are not efficient in a Fibonacci
    1.12 @@ -117,19 +117,19 @@
    1.13      */
    1.14      void push (Item const item, PrioType const value);
    1.15      
    1.16 -    ///Returns the item with minimum priority relative to \ref Compare.
    1.17 +    ///Returns the item with minimum priority relative to \c Compare.
    1.18      
    1.19      /**
    1.20 -       This method returns the item with minimum priority relative to \ref
    1.21 +       This method returns the item with minimum priority relative to \c
    1.22         Compare.  
    1.23         \pre The heap must be nonempty.  
    1.24      */
    1.25      Item top() const { return container[minimum].name; }
    1.26  
    1.27 -    ///Returns the minimum priority relative to \ref Compare.
    1.28 +    ///Returns the minimum priority relative to \c Compare.
    1.29  
    1.30      /**
    1.31 -       It returns the minimum priority relative to \ref Compare.
    1.32 +       It returns the minimum priority relative to \c Compare.
    1.33         \pre The heap must be nonempty.
    1.34      */
    1.35      PrioType prio() const { return container[minimum].prio; }
    1.36 @@ -155,10 +155,10 @@
    1.37      }
    1.38  
    1.39  
    1.40 -    ///Deletes the item with minimum priority relative to \ref Compare.
    1.41 +    ///Deletes the item with minimum priority relative to \c Compare.
    1.42  
    1.43      /**
    1.44 -    This method deletes the item with minimum priority relative to \ref
    1.45 +    This method deletes the item with minimum priority relative to \c
    1.46      Compare from the heap.  
    1.47      \pre The heap must be non-empty.  
    1.48      */
    1.49 @@ -177,7 +177,7 @@
    1.50      /**
    1.51         This method decreases the priority of \c item to \c value.
    1.52         \pre \c item must be stored in the heap with priority at least \c
    1.53 -       value relative to \ref Compare.
    1.54 +       value relative to \c Compare.
    1.55      */
    1.56      void decrease (Item item, PrioType const value); 
    1.57  
    1.58 @@ -187,7 +187,7 @@
    1.59         This method sets the priority of \c item to \c value. Though
    1.60         there is no precondition on the priority of \c item, this
    1.61         method should be used only if it is indeed necessary to increase
    1.62 -       (relative to \ref Compare) the priority of \c item, because this
    1.63 +       (relative to \c Compare) the priority of \c item, because this
    1.64         method is inefficient.
    1.65      */
    1.66      void increase (Item item, PrioType const value) {