lemon/bin_heap.h
changeset 190 1e6af6f0843c
parent 100 4f754b4cf82b
child 209 765619b7cbb2
equal deleted inserted replaced
0:450bb3865ee2 1:b18d44ba421a
    37   ///is a data structure for storing items with specified values called \e
    37   ///is a data structure for storing items with specified values called \e
    38   ///priorities in such a way that finding the item with minimum priority is
    38   ///priorities in such a way that finding the item with minimum priority is
    39   ///efficient. \c Compare specifies the ordering of the priorities. In a heap
    39   ///efficient. \c Compare specifies the ordering of the priorities. In a heap
    40   ///one can change the priority of an item, add or erase an item, etc.
    40   ///one can change the priority of an item, add or erase an item, etc.
    41   ///
    41   ///
    42   ///\param _Prio Type of the priority of the items.
    42   ///\tparam _Prio Type of the priority of the items.
    43   ///\param _ItemIntMap A read and writable Item int map, used internally
    43   ///\tparam _ItemIntMap A read and writable Item int map, used internally
    44   ///to handle the cross references.
    44   ///to handle the cross references.
    45   ///\param _Compare A class for the ordering of the priorities. The
    45   ///\tparam _Compare A class for the ordering of the priorities. The
    46   ///default is \c std::less<_Prio>.
    46   ///default is \c std::less<_Prio>.
    47   ///
    47   ///
    48   ///\sa FibHeap
    48   ///\sa FibHeap
    49   ///\sa Dijkstra
    49   ///\sa Dijkstra
    50   template <typename _Prio, typename _ItemIntMap,
    50   template <typename _Prio, typename _ItemIntMap,