| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:FIBONACCIJEVE KOPICE
Authors:ID Krstić, Stanko (Author)
ID Guid, Nikola (Mentor) More about this mentor... New window
Files:.pdf UNI_Krstic_Stanko_2013.pdf (1,42 MB)
MD5: C8D9747DCE2320EEAB29FD5FE4A6D160
 
Language:Slovenian
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Fibonaccijeva kopica je podatkovna struktura, ki je sestavljenja iz množice korenskih dreves. Za drevesa znotraj Fibonaccijeve kopice velja lastnost minimalnih kopic. Uporabljajo se pri algoritmih za urejanje podatkov kot prioritetna vrsta. Fibonaccijevo kopico ponazorimo kot vozlišče, ki vsebuje ključ, kazalec na očeta, sina in na prejšnjega in naslednjega soseda ter stopnjo vozlišča. Nad Fibonaccijevimi kopicami lahko izvajamo operacije vstavljanja, iskanja minimuma, izločanje minimuma, brisanja vozlišča, zmanjševanje ključa vozlišča in unije. Večina operacij se izvaja v konstantno amortiziranem času.
Keywords:Fibonaccijeva kopica, povezljiva kopica, podatkovna struktura
Place of publishing:Maribor
Publisher:[S. Krstić]
Year of publishing:2013
PID:20.500.12556/DKUM-41759 New window
UDC:004.422.6(043.2)
COBISS.SI-ID:17500438 New window
NUK URN:URN:SI:UM:DK:ABFHDQMS
Publication date in DKUM:19.09.2013
Views:1855
Downloads:170
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:FIBONACCI HEAPS
Abstract:A Fibonacci heap is a data structure made of a collection of trees. Trees in the Fibonacci heap obey the min-heap property. They are used in sorting algorithms as a priority queue. The Fibonacci heap is represented by nodes that contain a key, pointers to its parent, its child, its next and previous siblings, and a degree. With the Fibonacci heap we can do operations such as inserting, finding minimum, extracting minimum, deleting a node, decreasing a key and union. Most of the operations run in constant amortized time.
Keywords:Fibonacci heap, mergeable heap, data structure


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica