Fibonacci Heap
-
Only integer entries are accepted in the text field.
-
To insert an element, type an integer in the text field and click on Insert.
-
To find the minimum key in the root list, click on MinRoot
and the MinRoot node will be highlighted (red).
-
To delete the minimum key click on ExtractMin. The MinRoot node
will be highlighted (red). Continue clicking at
will on NextStep
to trace the algorithm until the button is disabled and the operation is
terminated.
-
To delete a key, select the node by clicking on it, click on Delete.
Continue clicking on NextStep
to trace the algorithm.*
- To decrease a key, select a node by clicking on it,
input an integer in the text field, and click on DecreaseKey.
Continue clicking on NextStep
to trace the algorithm.**
-
To switch to a new heap to operate on, click on Switch. The
current heap will move to the bottom. If there is already a heap on the bottom
then that will become the new working heap.
-
To perform a union on two heaps click on Union and continue
clicking on NextStep
until the algorithm is terminated.
-
To clear the working heap click on Reset.
* The marked node will be highlighted in
green.
**Node can be selected and temporarily moved by mouse.