prikaz prve stranice dokumenta Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji
  Download
PDF 7.93 MB
undergraduate thesis
Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji
2020. urn:nbn:hr:126:931946
Vuković, Filip
Josip Juraj Strossmayer University of Osijek
Department of Mathematics
Chair of Applied Mathematics and Computer Science
Computer Science and Machine Learning Research Group

Cite this document

Vuković, F. (2020). Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:931946

Vuković, Filip. "Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2020. https://urn.nsk.hr/urn:nbn:hr:126:931946

Vuković, Filip. "Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2020. https://urn.nsk.hr/urn:nbn:hr:126:931946

Vuković, F. (2020). 'Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 02 June 2023, https://urn.nsk.hr/urn:nbn:hr:126:931946

Vuković F. Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2020 [cited 2023 June 02] Available at: https://urn.nsk.hr/urn:nbn:hr:126:931946

F. Vuković, "Algoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:126:931946

Please login to the repository to save this object to your list.
Metadata
TitleAlgoritmi najkraćeg puta na grafovima i njihova primjena u cestovnoj navigaciji
Title (english)Shortest Path Algorithms on Graphs and Their Application in Road Navigation
AuthorFilip Vuković
MentorDomagoj Matijević (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
(Chair of Applied Mathematics and Computer Science)
(Computer Science and Machine Learning Research Group)
Osijek
Defense date and country2020-09-21, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Mathematical Logic and Accounting
Abstract
U ovom radu bavit ćemo se Dijkstrinim i A* algoritmima najkraćeg puta na grafovima te njihovom primjenom u cestovnoj navigaciji. Rad je podijeljen na dva dijela. U prvom dijelu upoznat ćemo se s osnovama teorije grafova te Dijkstrinim i A* algoritmom za pronalaženje najkraćeg puta na grafu. U drugom dijelu, bavit ćemo se implementacijom tih dvaju algoritama na podatcima preuzetim s OpenStreetMaps-a u programskom jeziku Pythonu.
Abstract (english)
In this paper we will discuss Dijkstra’s and A* shortest path algorithms on graphs and the implementation of those algorithms in road navigation. The paper is divided in two sections. In the first section, we will be introduced to basic concepts in graph theory and Dijkstra’s and A* shortest path algorithms. In the second section, we will implement said algorithms on exported data from OpenStreetMaps in Python programming language.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:931946
Study programmeTitle: University undergraduate study programme in mathematics
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2020-10-02 08:10:30