Fibonacci heap: Difference between revisions
Content added Content deleted
(Go solution) |
m (Separated task description from language entries.) |
||
| Line 1: | Line 1: | ||
{{draft task}} |
|||
== Fibonacci heap == |
|||
;Task: |
;Task: |
||
* Implement queue operations for fibonacci heaps. Where H is heap, x node with data value, k integer. |
* Implement queue operations for fibonacci heaps. Where H is heap, x node with data value, k integer. |
||
| Line 11: | Line 10: | ||
** DecreaseKey(H,x,k) - ecrease value of element x in heap H to value k |
** DecreaseKey(H,x,k) - ecrease value of element x in heap H to value k |
||
** Delete(H,x) - remove element x from heap H |
** Delete(H,x) - remove element x from heap H |
||
'''Contents''' |
|||
=={{header|C++}}== |
=={{header|C++}}== |
||