lemon/concepts/heap.h
changeset 771 8452ca46e29a
parent 709 0747f332c478
child 817 b87f0504cdbe
equal deleted inserted replaced
11:f9a368974ff7 12:081f6ad69eb0
    34     /// @{
    34     /// @{
    35 
    35 
    36     /// \brief The heap concept.
    36     /// \brief The heap concept.
    37     ///
    37     ///
    38     /// This concept class describes the main interface of heaps.
    38     /// This concept class describes the main interface of heaps.
    39     /// The various heap structures are efficient
    39     /// The various \ref heaps "heap structures" are efficient
    40     /// implementations of the abstract data type \e priority \e queue.
    40     /// implementations of the abstract data type \e priority \e queue.
    41     /// They store items with specified values called \e priorities
    41     /// They store items with specified values called \e priorities
    42     /// in such a way that finding and removing the item with minimum
    42     /// in such a way that finding and removing the item with minimum
    43     /// priority are efficient. The basic operations are adding and
    43     /// priority are efficient. The basic operations are adding and
    44     /// erasing items, changing the priority of an item, etc.
    44     /// erasing items, changing the priority of an item, etc.