diff -r b9a7f4115abe -r 9273fe7d850c lemon/radix_heap.h
--- a/lemon/radix_heap.h	Thu Oct 26 13:35:35 2006 +0000
+++ b/lemon/radix_heap.h	Thu Oct 26 14:20:17 2006 +0000
@@ -54,7 +54,6 @@
   /// item, but the priority cannot be decreased under the last removed 
   /// item's priority.
   ///
-  /// \param _Item Type of the items to be stored.  
   /// \param _ItemIntMap A read and writable Item int map, used internally
   /// to handle the cross references.
   ///
@@ -62,11 +61,11 @@
   /// \see Dijkstra
   /// \author Balazs Dezso
 
-  template <typename _Item, typename _ItemIntMap>
+  template <typename _ItemIntMap>
   class RadixHeap {
 
   public:
-    typedef _Item Item;
+    typedef typename _ItemIntMap::Key Item;
     typedef int Prio;
     typedef _ItemIntMap ItemIntMap;
 
@@ -299,7 +298,7 @@
     /// This method returns the item with minimum priority.  
     /// \pre The heap must be nonempty.  
     Item top() const {
-      const_cast<RadixHeap<Item, ItemIntMap>&>(*this).moveDown();
+      const_cast<RadixHeap<ItemIntMap>&>(*this).moveDown();
       return data[boxes[0].first].item;
     }
 
@@ -308,7 +307,7 @@
     /// It returns the minimum priority.
     /// \pre The heap must be nonempty.
     Prio prio() const {
-      const_cast<RadixHeap<Item, ItemIntMap>&>(*this).moveDown();
+      const_cast<RadixHeap<ItemIntMap>&>(*this).moveDown();
       return data[boxes[0].first].prio;
      }