From the Lab
Fibonacci Heap Cascading Cuts Demo
Related Projects:
Demonstration images showing how a Fibonacci min-heap rearranges itself following a few heap operations:
- Each image's filename is the description of the preceding heap operation which resulted in the current heap arrangement pictured.
- The first character of the filename indicates the position of the image in the sequence of heap operations.
- Images were produced in MATLAB using the built-in "treeplot" function (for the lines and points) and "treelayout" function (to get coordinates for the numbers displayed beside the nodes).
Related blog post: http://gigl.scs.carleton.ca/node/493