Fibonacci heap
In computer science, a Fibonacci Heap is a set of min-heap-ordered-trees. The Fibonacci heaps are similar to the binomial heaps and would have similar properties.
A Fibonacci heap has a minimum node, usually at the root of a tree containing a minimum key. The roots of all trees are usually linked using a circular, doubly linked list called the root list.
The Fibonacci heap's potential performance to do operations is given by
- Peformance = t + 2m
where t is the number of trees in the root list of a Fibonacci heap,
and m is the number of marked nodes.
- TODO: Draw a graphic rep of a b. heap
External links
- http://www.cs.yorku.ca/~aaw/Jason/FibonacciHeapAnimation.html
Referenced By
Data Structures | Data structure | Heap | List of data structures | List of graph theory topics
|
