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:
Algoritmi minimalnega vpetega drevesa v vsakdanjem življenju
Authors:
ID
Gajić, Marija
(
Author
)
ID
Sepesy Maučec, Mirjam
(
Mentor
)
More about this mentor...
ID
Donaj, Gregor
(
Comentor
)
Files:
UN_Gajic_Marija_2016.pdf
(1,34 MB)
MD5: D1643377CFADEC762E5A1416C57E8815
Language:
Slovenian
Work type:
Diploma project paper
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
V zaključni projketni nalogi je opisano minimalno vpeto drevo in načini iskanja minimalnega vpetega drevesa v grafu. Predstavljeni in analizirani so trije algoritmi in sicer Primov, Kruskalov in Boruvkin algoritem. Podrobneje so predstavljene tudi programske implementacije teh treh algoritmov. V nadaljevanju je predstavljena praktična uporaba minimalnega vpetega drevesa v vsakdanjem življenju ter opis enega konkretnega primera – postavljanja vodovodnega omrežja. Za izbiro optimalnega algoritma so java programske implementacije algoritmov testirane na 408 testnih datotekah z grafi. Analizirana je odvisnost časovne zahtevnosti algoritma od števila povezav v grafu. Hkrati je predstavljena še primerjava časovne učinkovitosti vseh treh analiziranih algoritmov.
Keywords:
minimalno vpeto drevo
,
uporaba v vsakdanjem življenju
,
primerjava algoritmov
,
časovna zahtevnost
Place of publishing:
Maribor
Publisher:
[M. Gajić]
Year of publishing:
2016
PID:
20.500.12556/DKUM-61029
UDC:
621.39
COBISS.SI-ID:
20406294
NUK URN:
URN:SI:UM:DK:4XXPJGOL
Publication date in DKUM:
22.03.2017
Views:
3904
Downloads:
222
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:
Minimum spanning tree algorithms in everyday life
Abstract:
The final project work describes the minimum spanning tree and a way to find the minimum spanning tree in the graph. Three different algorithms are presented and analyzed: Prim’s, Kruskal’s and Boruvka’s. Software implementation of each algorithm is also discussed. Furthermore, usage of the minimum spanning tree in everyday life is addressed through description of one practical problem regarding a water supply network and its solution. For making the best choice between the algorithms, three Java software implementations are tested on 408 graphs. Dependency of the time efficiency given the overall number of edges in the graph with the constant number of vertices is presented, together with comparison of time efficiencies for all three algorithms.
Keywords:
minimum spanning tree
,
comparison of different algorithms
,
usage in everyday life
,
time complexity
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
