prikaz prve stranice dokumenta Algoritmi pretrage u stablu
  Download
PDF 3.93 MB
master's thesis
Algoritmi pretrage u stablu
Split: University of Split, Faculty of Science, 2023. urn:nbn:hr:166:050841
Pintur, Antonela
University of Split
Faculty of Science
Department of Mathematics

Institutional repository: Repository of Faculty of Science

Cite this document

Pintur, A. (2023). Algoritmi pretrage u stablu (Master's thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:050841

Pintur, Antonela. "Algoritmi pretrage u stablu." Master's thesis, University of Split, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:166:050841

Pintur, Antonela. "Algoritmi pretrage u stablu." Master's thesis, University of Split, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:166:050841

Pintur, A. (2023). 'Algoritmi pretrage u stablu', Master's thesis, University of Split, Faculty of Science, accessed 04 December 2024, https://urn.nsk.hr/urn:nbn:hr:166:050841

Pintur A. Algoritmi pretrage u stablu [Master's thesis]. Split: University of Split, Faculty of Science; 2023 [cited 2024 December 04] Available at: https://urn.nsk.hr/urn:nbn:hr:166:050841

A. Pintur, "Algoritmi pretrage u stablu", Master's thesis, University of Split, Faculty of Science, Split, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:166:050841

Metadata
TitleAlgoritmi pretrage u stablu
Title (english)Tree-search algorithms
AuthorAntonela Pintur
MentorTanja Vojković (mentor)
Committee memberTanja Vojković (predsjednik povjerenstva)
Committee memberAna Laštre (član povjerenstva)
Committee memberGoran Erceg (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Mathematics)
Split
Defense date and country2023-05-18, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
Teorija grafova je danas iznimno popularna grana matematike sa širokim primjenama. Najčešće primjene su u rješavanju problema pronalaska najkraćih puteva kako bi se minimizirali razni troškovi pa je korisno pogledati različite algoritme pretrage koje imamo u stablima. Najpoznatiji algoritmi su Jarnik-Prim algoritam i Boruvka-Kruskal kojima je jedina razlika u redoslijedu odabira bridova (”puteva”), a kao rezultat daju jednako stablo.
Abstract (english)
Graph theory is lately an extremely popular branch of mathematics with wide applications. The most common applications are in solving problems of finding the shortest paths to minimize various costs, so it is useful to look and understand different types of search algorithms that are used in trees. The most famous algorithms are Jarnik-Prim algorithm and Boruvka-Kruskal. The only difference between these two is in the order selection of edges (”paths“) but the result is the same tree in both cases.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:050841
Study programmeTitle: Mathematics; specializations in: major in pure mathematics, major in computing, major in teaching, major in statistics and computing
Course: major in computing
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2023-05-24 11:49:13