COIN-OR::LEMON - Graph Library

Changeset 911:89a4fbb99cad in lemon-0.x for src/hugo/fib_heap.h


Ignore:
Timestamp:
09/28/04 09:00:58 (20 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1222
Message:

Fix many doxygen command bugs.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/fib_heap.h

    r906 r911  
    3636  ///is a data structure for storing items with specified values called \e
    3737  ///priorities in such a way that finding the item with minimum priority is
    38   ///efficient. \ref Compare specifies the ordering of the priorities. In a heap
     38  ///efficient. \c Compare specifies the ordering of the priorities. In a heap
    3939  ///one can change the priority of an item, add or erase an item, etc.
    4040  ///
     
    118118    void push (Item const item, PrioType const value);
    119119   
    120     ///Returns the item with minimum priority relative to \ref Compare.
    121    
    122     /**
    123        This method returns the item with minimum priority relative to \ref
     120    ///Returns the item with minimum priority relative to \c Compare.
     121   
     122    /**
     123       This method returns the item with minimum priority relative to \c
    124124       Compare. 
    125125       \pre The heap must be nonempty. 
     
    127127    Item top() const { return container[minimum].name; }
    128128
    129     ///Returns the minimum priority relative to \ref Compare.
    130 
    131     /**
    132        It returns the minimum priority relative to \ref Compare.
     129    ///Returns the minimum priority relative to \c Compare.
     130
     131    /**
     132       It returns the minimum priority relative to \c Compare.
    133133       \pre The heap must be nonempty.
    134134    */
     
    156156
    157157
    158     ///Deletes the item with minimum priority relative to \ref Compare.
    159 
    160     /**
    161     This method deletes the item with minimum priority relative to \ref
     158    ///Deletes the item with minimum priority relative to \c Compare.
     159
     160    /**
     161    This method deletes the item with minimum priority relative to \c
    162162    Compare from the heap. 
    163163    \pre The heap must be non-empty. 
     
    178178       This method decreases the priority of \c item to \c value.
    179179       \pre \c item must be stored in the heap with priority at least \c
    180        value relative to \ref Compare.
     180       value relative to \c Compare.
    181181    */
    182182    void decrease (Item item, PrioType const value);
     
    188188       there is no precondition on the priority of \c item, this
    189189       method should be used only if it is indeed necessary to increase
    190        (relative to \ref Compare) the priority of \c item, because this
     190       (relative to \c Compare) the priority of \c item, because this
    191191       method is inefficient.
    192192    */
Note: See TracChangeset for help on using the changeset viewer.