Fibonacci heap: Difference between revisions

;Task:

* Implement queue operations for fibonacci heaps. Where H is heap, x node with data value, k integer.

** DecreaseKey(H,x,k) - ecrease value of element x in heap H to value k

** Delete(H,x) - remove element x from heap H

 

=={{header|C++}}==