diplomsko delo
Benjamin Dobravec (Author), Simon Kolmanič (Mentor)

Abstract

V diplomskem delu smo opisovali delovanje algoritmov za sikanje minimalnih vpetih dreves s posebnim poudarkom na algoritmu Boruvka. Vsi trije eksaktni algoritmi za iskanje minimalnih vpetih dreves so bili implementirani v testni aplikaciji, kjer lahko uporabnik izbira med Primovim, Kruskalovim in algoritmom Boruvke. Minimalno vpeto drevo lahko iščemo na naključnem polnem grafu, ki ga generira sama aplikacija ali pa na uporabniško generiranem grafu. V obeh primerih sta vhodni graf in rešitev grafično prikazana. Diplomo zaključujemo s primerjavo časovne zahtevnosti vseh treh algoritmov.

Keywords

minimalna vpeta drevesa;algoritem Boruvka;Kruskalov algoritem;Primov algoritem;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: B. Dobravec
UDC: 004.422.635.3:519.163(043.2)
COBISS: 19383318 Link will open in a new window
Views: 1207
Downloads: 134
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: MINIMAL SPANNING TREE SEARCH WITH BORUVKA ALGORITHM
Secondary abstract: This thesis describes the operation of the exact algorithms for finding the minimum spanning trees with emphasis on the Boruvka algorithm. All algorithms were implemented in a testing application for minimal spanning tree search. The user can choose between Prim, Kruskal, and Boruvka algorithms to search for minimal spanning trees on a random complete graphs, generated by application or on user defined graphs. In both cases the input graphs and the results are visualised. Finally the time complexity for all three algorithms is given at the end.
Secondary keywords: minimum spanning trees;Boruvka's algorithm;Kruskal's algorithm;Prim's algorithm;
URN: URN:SI:UM:
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: VII, 48 f.
ID: 8890375