prikaz prve stranice dokumenta Analiza i primjene Dijkstrinog algoritma
No public access
undergraduate thesis
Analiza i primjene Dijkstrinog algoritma
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. urn:nbn:hr:168:543709
Jurić, Mislav
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Jurić, M. (2016). Analiza i primjene Dijkstrinog algoritma (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:543709

Jurić, Mislav. "Analiza i primjene Dijkstrinog algoritma." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. https://urn.nsk.hr/urn:nbn:hr:168:543709

Jurić, Mislav. "Analiza i primjene Dijkstrinog algoritma." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. https://urn.nsk.hr/urn:nbn:hr:168:543709

Jurić, M. (2016). 'Analiza i primjene Dijkstrinog algoritma', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 02 December 2024, https://urn.nsk.hr/urn:nbn:hr:168:543709

Jurić M. Analiza i primjene Dijkstrinog algoritma [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2016 [cited 2024 December 02] Available at: https://urn.nsk.hr/urn:nbn:hr:168:543709

M. Jurić, "Analiza i primjene Dijkstrinog algoritma", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:168:543709

Metadata
TitleAnaliza i primjene Dijkstrinog algoritma
Title (english)Dijkstra Algorithm, Analysis and Applications
AuthorMislav Jurić
MentorAndrea Aglić-Aljinović (mentor)
Committee memberAndrea Aglić Aljinović (predsjednik povjerenstva)
Committee memberMario Krnić (član povjerenstva)
Committee memberAna Žgaljić Keko (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2016-07-11, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Značajan razvoj algoritma pretraživanja usmjerenog grafa nalazimo 50-ih godina prošlog stoljeća. E. W. Dijkstra konstruirao je algoritam na temelju kojeg su kasnije proizašle različite inačice i poopćeni oblici. Svima je zajedničko otkrivanje puta, koji ne mora uvijek biti optimalan. Zbog nedostatka memorije umjesto pretraživanja s jednolikom cijenom, tj. pretraživanja u širinu, možemo koristiti pretraživanje u dubinu. Isto tako, imamo mogućnost kombiniranja prednosti obje vrste algoritma te time dobivamo algoritam iterativnog pretraživanja u dubinu. Svakodnevno se susrećemo s problemom pretraživanja usmjerenog grafa, često ni ne razmišljajući o tome. Prilikom povezivanja na Internet, ili korištenja aplikacije koja sadrži digitalni zapis karte, Dijkstrin algoritam i njegovi oblici, poput algoritma pretraživanja s jednolikom cijenom, osiguravaju nam njihovo nesmetano korištenje. E. W. Dijkstra posvetio je gotovo cijeli svoj život razvoju računarstva i na tome smo mu zahvalni.
Abstract (english)
Significant development of algorithms for finding the shortest paths between nodes in a graph has begun in 1950s. E. W. Dijkstra has conceived an algorithm, on which later on were based many others. All algorithms have in common discovering the path between two nodes, which sometimes is not the optimal one. Because of the lack of memory or computer resource, we prefer to use depth-first search instead of breadth-first search, in case of uniform transition costs. Furthermore, we can combine the benefits from each algorithm and therefore use iterative search in depth. Finding the shortest path is almost an everyday problem. For an example, it is used when we connect to the Internet or when we want to find directions on digital map. In these cases, uniform-cost search algorithm does all the work in the background. E. W. Dijkstra has dedicated his whole life to computer science and its development and we are very thankful for that.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:543709
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2018-02-06 09:31:49