Changeset 1205:a9a3354b01d4 in lemon-0.x for src/lemon/radix_heap.h

Timestamp:

03/09/05 15:06:32 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1624

Message:

Bug fix in radix heap.

File:

• src/lemon/radix_heap.h (modified) (3 diffs)

src/lemon/radix_heap.h

@@ -31 +31 @@
   /// @{
 
-   /// A Binary Heap implementation.
+  /// A Radix Heap implementation.
   
   ///\todo Please document...
@@ -157 +157 @@
     /// \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);
@@ -335 +335 @@
     }
 
-    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