Loading...
Please wait, while we are loading the content...
Similar Documents
Fibonacci Heap Data Structure
| Content Provider | Scilit |
|---|---|
| Author | Goldman, Sally. A. Goldman, Kenneth. J. |
| Copyright Year | 2007 |
| Description | Strengths: The Fibonacci heap is theoretically the best data structure. It is the only priority queue data structure with constant amortized cost for merging two priority queues, and also increasing the priority of an element through a locator. The pairing heap, in contrast, has a logarithmic amortized cost for both of these operations. Since Prim's minimum spanning tree algorithm and Dijkstra's shortest path algorithm are dominated by the cost of increasing the priority of elements, the Fibonacci heap yields the theoretically best worst-case time complexities for these algorithms. Book Name: A Practical Guide to Data Structures and Algorithms using Java |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2009-0-19205-6&isbn=9780429147104&doi=10.1201/9781420010336-34&format=pdf |
| Ending Page | 471 |
| Page Count | 20 |
| Starting Page | 452 |
| DOI | 10.1201/9781420010336-34 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2007-08-23 |
| Access Restriction | Open |
| Subject Keyword | Book Name: A Practical Guide to Data Structures and Algorithms using Java Statistics and Probability Data Structure Theoretically Fibonacci Heap |
| Content Type | Text |
| Resource Type | Chapter |