Download
PDF 534.74 KB
undergraduate thesis
41   13
Application of Graph Algorithms for Finding Optimal Route on Geo. Maps
Danilo Šormaz (2016)
Josip Juraj Strossmayer University of Osijek
Department of Mathematics
Chair of Applied Mathematics
Computer Science Research Group
Cite this document...

Šormaz, D. (2016). Primjena graf algoritama za pronalaženje optimalne rute na mapama (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:534030

Šormaz, Danilo. "Primjena graf algoritama za pronalaženje optimalne rute na mapama." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2016. https://urn.nsk.hr/urn:nbn:hr:126:534030

Šormaz, Danilo. "Primjena graf algoritama za pronalaženje optimalne rute na mapama." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2016. https://urn.nsk.hr/urn:nbn:hr:126:534030

Šormaz, D. (2016). 'Primjena graf algoritama za pronalaženje optimalne rute na mapama', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 21 July 2019, https://urn.nsk.hr/urn:nbn:hr:126:534030

Šormaz D. Primjena graf algoritama za pronalaženje optimalne rute na mapama [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2016 [cited 2019 July 21] Available at: https://urn.nsk.hr/urn:nbn:hr:126:534030

D. Šormaz, "Primjena graf algoritama za pronalaženje optimalne rute na mapama", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:126:534030

Metadata
TitlePrimjena graf algoritama za pronalaženje optimalne rute na mapama
Title (english)Application of Graph Algorithms for Finding Optimal Route on Geo. Maps
AuthorDanilo Šormaz
MentorDomagoj Matijević (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
(Chair of Applied Mathematics)
(Computer Science Research Group)
Osijek
Defense date and country2016-09-30, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Mathematical Logic and Accounting
Abstract
Glavna tema ovog rada su graf algoritmi za pronalaženje najkraće rute na mapama. U prvom poglavlju denirat ćemo graf u matematičkom smislu, spomenuti i objasniti vrste grafova te dati par primjera različitih tipova grafova.U drugom dijelu poglavlja predstavit ćemo načine reprezentacije grafa u memoriji računala. U drugom poglavlju denirat ćemo šetnju kroz graf i putove u grafu. Nakon toga ćemo pojasniti obilazak grafova pomoću pretraživanja grafa po širini i dubini.Objasnit ćemo problem najkraćeg puta, raspisati Dijsktrin algoritam i na osnovu njega izvesti tehnike ubrzavanja kao što su dvosmjerno pretraživanje, A* i ALT.
Abstract (english)
The main topic of this thesis are shortest path graph algorithms. In the rst part of the paper we shall dene a graph in mathematical sense, mention and explain types of graphs and give some examples of dierent graphs. In the second part of the rst chapter we'll present how to store or represent graph in comupter memory. In the second part we shalll dene walk and paths in graph. After that Breadth-First Search and Depth-First Search is presented. We'll explain shortest path problem, write out Dijkstra's algorithm and presented speed-up techniques such as bidirectional search, A* and ALT.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:534030
Study programmeTitle: Matematika
Study programme type: sveučilišni
Study level: preddiplomski
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 usehttp://rightsstatements.org/vocab/InC/1.0/
Created on2016-10-17 10:12:23