Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms: O(log n) Amortized Time for Delete Min and Delete, O(1) for Every Other F-Heap OperationResearch Paper
Many network optimization algorithms spend most of their time in a heap (priority queue): a set of items with real keys that supports inserting an item, finding and deleting an item of minimum key, melding two heaps, decreasing the key of an item, and deleting an arbitrary item. Dijkstra's shortest-path algorithm performs at most one delete min per vertex…