diff --git a/lemon/binom_heap.h b/lemon/binomial_heap.h
copy from lemon/binom_heap.h
copy to lemon/binomial_heap.h
--- a/lemon/binom_heap.h
+++ b/lemon/binomial_heap.h
@@ -16,8 +16,8 @@
  *
  */
 
-#ifndef LEMON_BINOM_HEAP_H
-#define LEMON_BINOM_HEAP_H
+#ifndef LEMON_BINOMIAL_HEAP_H
+#define LEMON_BINOMIAL_HEAP_H
 
 ///\file
 ///\ingroup heaps
@@ -53,7 +53,7 @@
 #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;
@@ -94,7 +94,7 @@
     /// \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.
@@ -104,7 +104,7 @@
     /// 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.
@@ -424,7 +424,7 @@
   private:
 
     class Store {
-      friend class BinomHeap;
+      friend class BinomialHeap;
 
       Item name;
       int parent;
@@ -441,5 +441,5 @@
 
 } //namespace lemon
 
-#endif //LEMON_BINOM_HEAP_H
+#endif //LEMON_BINOMIAL_HEAP_H