Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
ISKANJE MINIMALNEGA VPETEGA DREVESA Z ALGORITMOM BORUVKE
Authors:
ID
Dobravec, Benjamin
(
Author
)
ID
Kolmanič, Simon
(
Mentor
)
More about this mentor...
Files:
VS_Dobravec_Benjamin_2015.pdf
(2,55 MB)
MD5: 499FC1502BF4E7ACB8F1131BB17B0A7E
Language:
Slovenian
Work type:
Bachelor thesis/paper
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
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
Place of publishing:
[Maribor
Publisher:
B. Dobravec
Year of publishing:
2015
PID:
20.500.12556/DKUM-54758
UDC:
004.422.635.3:519.163(043.2)
COBISS.SI-ID:
19383318
NUK URN:
URN:SI:UM:DK:YSNI82VS
Publication date in DKUM:
14.10.2015
Views:
2067
Downloads:
220
Metadata:
Categories:
KTFMB - FERI
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
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:
MINIMAL SPANNING TREE SEARCH WITH BORUVKA ALGORITHM
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.
Keywords:
minimum spanning trees
,
Boruvka’s algorithm
,
Kruskal’s algorithm
,
Prim’s algorithm
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
