A Fibonacci heap (F-heap) is a collection of heap-ordered trees. F-heaps are the type of data structure in which the work that must be done to reorder the structure is postponed until the very last possible moment. F-heaps are useful for algorithms involving graph data structures, such as those used for computing shortest paths in computer networks . The common operations supported by F-heaps are insert, minimum, extract-min, union, decrease-key, and delete. These operations are described below. • Insert: A new node is inserted into the heap by simply adding the node to the root list and updating the pointer to the minimum node if necessary.