Please find a sandbox/playground to play with Fibonacci heaps, a data structure for implementing a priority queue. As it makes the most, the tool may also illustrate a binary heap, a binomial heap.
- Move nodes and connect nodes
- Add new node by clicking at the top of the screen or pressing enter
- Delete a node by moving it at the top of the screen
- Marking nodes by clicking with the right button
