Fibonaccijeva hrpa

Lončar, Marino (2016) Fibonaccijeva hrpa. Diploma thesis, Faculty of Science > Department of Mathematics.

Language: Croatian

Download (1MB) | Preview
[img] Archive
Language: Croatian

Download (60kB)


Fibonacci heap is a variant of heap, developed by Fredman and Tarjan with the purpose of improving Dijkstra’s shortest path algorithm. Fibonacci heap is a first heap that accomplishes insert and decrease key operations in constant amortized time with logarithmic time for deleting the elements. Because of the importance of Fibonacci heap in the field of computer science, this work describes Fibonacci heap and its influence on the field of combinatorial optimization. Analysis on the influence of Fibonacci heaps in Dijkstra’s and Prim’s algorithms has been made, in respect to some other possible implementations of priority queue.

Item Type: Thesis (Diploma thesis)
Supervisor: Singer, Saša
Date: 2016
Number of Pages: 35
Subjects: NATURAL SCIENCES > Mathematics
Divisions: Faculty of Science > Department of Mathematics
Depositing User: Iva Prah
Date Deposited: 07 Apr 2016 11:49
Last Modified: 07 Apr 2016 11:49

Actions (login required)

View Item View Item

Nema podataka za dohvacanje citata