Fibonacci Heap - An efficient priority Queue data structure (Introduction)

Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better amortized running time than many other priority queue data structures including the binary heap and binomial heap. Michael L. Fredman and Robert E. Tarjan developed Fibonacci heaps in 1984 and published them in a scientific journal in 1987. They named Fibonacci heaps after the Fibonacci numbers, which are used in their running time analysis.

Using Fibonacci heaps for priority queues improves the asymptotic running time of important algorithms, such as Dijkstra's algorithm for computing the shortest path between two nodes in a graph, compared to the same algorithm using other slower priority queue data structures

Introduction to Algorithms by CLRS
some internet sources

[abhinavchawlacd]

not able to understand the topic. i think either the topic is complex or video lecture can be improved a bit .. fibonacci heap diagram was not clear at all

[ShubhamKumar-rmqe]

A superb video. Can you please provide the slides. It will be very helpful for revision at last stage.

[srijanbajpai]

Kuch bhi clear nhi ho rha is lecture hai isme ..

[shreshthsharma]

dont mind but do some work on your english...because it is confusing the concept you want to tell..anyways thanks a lot it helped a lot...