Marek Chocholáček
Bachelor's thesis
Prioritní fronty
Priority Queues
Abstract:
V mojej práci implementujem a experimentálne testujem niekoľko variant ov háld bežne používaných ako prioritné fronty. Tieto varianty zahŕňajú binárnu haldu, Fibonacciho haldu, binomiálnu haldu, violation haldu a rank-pairing haldu. Tieto štruktúry testujem na umelo vytvorených dátach a dátach z reálneho sveta.Abstract:
In my thesis I am implementing and experimentally testing several heap variants commonly used as priority queues. These variants include binary heap, Fibonacci heap, binomial heap, violation heap and rank-pairing heap. I am testing these structures on both artificial and real-world workloads.
Language used: English
Date on which the thesis was submitted / produced: 27. 5. 2019
Identifier:
https://is.muni.cz/th/vyjjc/
Thesis defence
- Date of defence: 27. 6. 2019
- Supervisor: prof. RNDr. Ivana Černá, CSc.
- Reader: RNDr. Jaromír Plhák, Ph.D.
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Applied Informatics / Applied Informatics
Theses on a related topic
- No theses on a related topic available.