Fibonacci heap: Difference between revisions

added a Wiki link, added space before the TOC (table of contents).
m (correct a spelling error in the task preamble.)
(added a Wiki link, added space before the TOC (table of contents).)
Line 1:
{{draft task}}
{{Wikipedia|Fibonacci heap}}
 
 
;Task:
* Implement queue operations for fibonacci'''Fibonacci heaps'''. Where H is heap, x node with data value, k integer.
*Operations:
** MakeHeap() - create new empty Fibonacci heap
Line 10 ⟶ 13:
** DecreaseKey(H,x,k) - decrease value of element x in heap H to value k
** Delete(H,x) - remove element x from heap H
<br><br>
 
 
 
=={{header|C++}}==