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