Fibonacci heap
Fibonacci heap is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
Fibonacci heap
Data structure for priority queue operations consisting of a collection of heap-ordered trees. Operations:
- MakeHeap() - create new empty Fibonacci heap
- Insert(H,x) - insert new element x into heap H
- Union(H1, H2) - union heap H1 and heap H2
- Minimum(H) - return minimum value from heap H
- ExtractMin(H) - return minimum value from heap H and remove it from heap
- DecreaseKey(H,x,k) - ecrease value of element x in heap H to value k
- Delete(H,x) - remove element x from heap H