This project showcases a dynamic and interactive visualization of the Fibonacci Heap data structure using HTML, CSS and JavaScript. It allows users to explore the operations of insertion, deletion, minimum extraction and merging, providing a clear understanding of how the heap functions.
The Fibonacci Heap is a specialized data structure known for its efficient operations, particularly for finding the minimum element and merging heaps. It utilizes a unique structure with linked trees and ranking mechanisms to optimize these functionalities.
Animated operations showcase the dynamic changes in the heap structure, aiding in comprehension.
Buttons and sliders enable users to control operations and customize heap size, offering an interactive learning experience.
The web-based design allows for easy access from any web browser, eliminating the need for local installation.
Provides the basic structure and content of the website.
Styles the visual elements of the website, including the layout, colors, and fonts.
Responsible for the interactive functionalities of the simulation, including user interaction, animation, and data manipulation.
The Fibonacci Heap Simulator is currently deployed and accessible online: