diff -r c3e29c6ae4e4 -r a9a3354b01d4 src/lemon/radix_heap.h
--- a/src/lemon/radix_heap.h	Mon Mar 07 08:54:45 2005 +0000
+++ b/src/lemon/radix_heap.h	Wed Mar 09 14:06:32 2005 +0000
@@ -30,7 +30,7 @@
   /// \addtogroup auxdat
   /// @{
 
-   /// A Binary Heap implementation.
+  /// A Radix Heap implementation.
   
   ///\todo Please document...
   ///
@@ -156,7 +156,7 @@
 
     /// \brief Move an item up into the proper box.
     void bubble_up(int index) {
-      if (!lower(data[index].box, index)) return;
+      if (!lower(data[index].box, data[index].prio)) return;
       remove(index);
       int box = findUp(data[index].box, data[index].prio);
       insert(box, index);      
@@ -334,16 +334,16 @@
       return state_enum(s);
     }
 
-    void print() const {
-      for (int i = 0; i < boxes.size(); ++i) {
-	printf("(%d, %d) ", boxes[i].min, boxes[i].size);
-	for (int k = boxes[i].first; k != -1; k = data[k].next) {
-	  printf("%d ", data[k].prio);
-	}
-	printf("\n");
-      }
-      fflush(stdout);
-    }
+//     void print() const {
+//       for (int i = 0; i < boxes.size(); ++i) {
+// 	printf("(%d, %d) ", boxes[i].min, boxes[i].size);
+// 	for (int k = boxes[i].first; k != -1; k = data[k].next) {
+// 	  printf("%d ", data[k].prio);
+// 	}
+// 	printf("\n");
+//       }
+//       fflush(stdout);
+//     }
 
   }; // class RadixHeap