1.1 --- a/lemon/bin_heap.h	Thu Jul 23 18:13:59 2009 +0200
     1.2 +++ b/lemon/bin_heap.h	Sun Aug 02 13:44:45 2009 +0200
     1.3 @@ -33,23 +33,23 @@
     1.4    ///
     1.5    ///\brief A Binary Heap implementation.
     1.6    ///
     1.7 -  ///This class implements the \e binary \e heap data structure. 
     1.8 -  /// 
     1.9 +  ///This class implements the \e binary \e heap data structure.
    1.10 +  ///
    1.11    ///A \e heap is a data structure for storing items with specified values
    1.12    ///called \e priorities in such a way that finding the item with minimum
    1.13 -  ///priority is efficient. \c Comp specifies the ordering of the priorities.
    1.14 +  ///priority is efficient. \c CMP specifies the ordering of the priorities.
    1.15    ///In a heap one can change the priority of an item, add or erase an
    1.16    ///item, etc.
    1.17    ///
    1.18    ///\tparam PR Type of the priority of the items.
    1.19    ///\tparam IM A read and writable item map with int values, used internally
    1.20    ///to handle the cross references.
    1.21 -  ///\tparam Comp A functor class for the ordering of the priorities.
    1.22 +  ///\tparam CMP A functor class for the ordering of the priorities.
    1.23    ///The default is \c std::less<PR>.
    1.24    ///
    1.25    ///\sa FibHeap
    1.26    ///\sa Dijkstra
    1.27 -  template <typename PR, typename IM, typename Comp = std::less<PR> >
    1.28 +  template <typename PR, typename IM, typename CMP = std::less<PR> >
    1.29    class BinHeap {
    1.30  
    1.31    public:
    1.32 @@ -62,7 +62,7 @@
    1.33      ///\e
    1.34      typedef std::pair<Item,Prio> Pair;
    1.35      ///\e
    1.36 -    typedef Comp Compare;
    1.37 +    typedef CMP Compare;
    1.38  
    1.39      /// \brief Type to represent the items states.
    1.40      ///