lemon-1.3: comparison lemon/binomial

equal deleted inserted replaced

-:847a7cba7470
+:b036ebcfd839
 * express or implied, and with no claim as to its suitability for any
 * purpose.
 *
 */
-#ifndef LEMON_BINOM_HEAP_H
+#ifndef LEMON_BINOMIAL_HEAP_H
-#define LEMON_BINOM_HEAP_H
+#define LEMON_BINOMIAL_HEAP_H
 ///\file
 ///\ingroup heaps
 ///\brief Binomial Heap implementation.
 #ifdef DOXYGEN
 template <typename PR, typename IM, typename CMP>
 #else
 template <typename PR, typename IM, typename CMP = std::less<PR> >
 #endif
-class BinomHeap {
+class BinomialHeap {
 public:
 /// Type of the item-int map.
 typedef IM ItemIntMap;
 /// Type of the priorities.
 typedef PR Prio;
 ///
 /// Constructor.
 /// \param map A map that assigns \c int values to the items.
 /// It is used internally to handle the cross references.
 /// The assigned value must be \c PRE_HEAP (<tt>-1</tt>) for each item.
-explicit BinomHeap(ItemIntMap &map)
+explicit BinomialHeap(ItemIntMap &map)
 : _min(0), _head(-1), _iim(map), _num_items(0) {}
 /// \brief Constructor.
 ///
 /// Constructor.
 /// \param map A map that assigns \c int values to the items.
 /// It is used internally to handle the cross references.
 /// The assigned value must be \c PRE_HEAP (<tt>-1</tt>) for each item.
 /// \param comp The function object used for comparing the priorities.
-BinomHeap(ItemIntMap &map, const Compare &comp)
+BinomialHeap(ItemIntMap &map, const Compare &comp)
 : _min(0), _head(-1), _iim(map), _comp(comp), _num_items(0) {}
 /// \brief The number of items stored in the heap.
 ///
 /// This function returns the number of items stored in the heap.
 }
 private:
 class Store {
-friend class BinomHeap;
+friend class BinomialHeap;
 Item name;
 int parent;
 int right_neighbor;
 int child;
 };
 };
 } //namespace lemon
-#endif //LEMON_BINOM_HEAP_H
+#endif //LEMON_BINOMIAL_HEAP_H

changeset 866	2d9c6566a604
parent 707	3887d6f994d7
child 877	141f9c0db4a3