Ticket #646: binomHeapFix.patch

lemon/binomial_heap.h

@@ -174 +174 @@
         _min=i;
       } else {
         merge(i);
-        if( _comp(_data[i].prio, _data[_min].prio) ) _min=i;
+        _min=findMin();
       }
       ++_num_items;
     }

test/heap_test.cc

@@ -255 +255 @@
     typedef BinomialHeap<Prio, IntNodeMap > NodeHeap;
     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
     dijkstraHeapTest<NodeHeap>(digraph, length, source);
+
+    {
+      ListDigraph g;
+      ListDigraph::Node v0 = g.addNode();
+      ListDigraph::Node v1 = g.addNode();
+      ListDigraph::NodeMap<int> ref(g,-1);
+      lemon::BinomialHeap<int,ListDigraph::NodeMap<int> > h(ref);
+      h.push(v0,0);
+      h.push(v1,0);
+      h.pop();
+      h.pop();
+    }
   }
 
   // BucketHeap, SimpleBucketHeap