prikaz prve stranice dokumenta ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA
Access restricted to students and staff of home institution
undergraduate thesis
ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA
2016. urn:nbn:hr:143:106627
Čorić, Anamarija
Šibenik University of Applied Sciences
Traffic

Cite this document

Čorić, A. (2016). ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA (Undergraduate thesis). Šibenik: Šibenik University of Applied Sciences. Retrieved from https://urn.nsk.hr/urn:nbn:hr:143:106627

Čorić, Anamarija. "ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA." Undergraduate thesis, Šibenik University of Applied Sciences, 2016. https://urn.nsk.hr/urn:nbn:hr:143:106627

Čorić, Anamarija. "ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA." Undergraduate thesis, Šibenik University of Applied Sciences, 2016. https://urn.nsk.hr/urn:nbn:hr:143:106627

Čorić, A. (2016). 'ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA', Undergraduate thesis, Šibenik University of Applied Sciences, accessed 22 January 2025, https://urn.nsk.hr/urn:nbn:hr:143:106627

Čorić A. ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA [Undergraduate thesis]. Šibenik: Šibenik University of Applied Sciences; 2016 [cited 2025 January 22] Available at: https://urn.nsk.hr/urn:nbn:hr:143:106627

A. Čorić, "ALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA", Undergraduate thesis, Šibenik University of Applied Sciences, Šibenik, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:143:106627

Please login to the repository to save this object to your list.
Metadata
TitleALGORITAM ZA TRAŽENJE NAJKRAĆEG PUTA
Title (english)ALGORITHMS FOR FINDING THE SHORTEST PATH
AuthorAnamarija Čorić
MentorIvana Beljo (mentor)
GranterŠibenik University of Applied Sciences
(Traffic)
Šibenik
Defense date and country2016, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Traffic and Transport Technology
Abstract
U radu se opisuju algoritmi za traženje najkraćeg puta. Ovi algoritmi spadaju pod teoriju grafova koja je u ovom radu također predstavljena. Opsiani su Dijkstrin, Bellman-Fordov i Floyd-Warshallov algoritam. U radu je također opisana i teorija igara, kvantitativna metoda odlučivanja koja se koristi u prometnim studijama. Ovom metodom se rješavaju matematički modeli realnih problema kako bi se donijele optimalne odluke. Opisan je povijesni razvoj metode, te su objašnjeni osnovni pojmovi vezani uz metodu. Također, u radu su izneseni primjeri koji pokazuju primjenu teorije igara i algoritama za rješavanje najkraćeg puta.
Abstract (english)
This paper describes the algorithms for finding the shortest path. These algorithms belong under the graph theory which is also presented within this paper. The Dijkstra, Bellman-Ford and Floyd-Warshall algortihm are described. The game theory, a quantitative decision-making method which is used within traffic studies, is also described within this paper. This method is used for solving the mathematical models of real problems in order to make the optimal decisions. The historical development of the method is described and the basic terms related to this method are explained. The examples which show the application of the game theory and algorithms for finding the shortest path are also given in the paper.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:143:106627
Study programmeTitle: Undergraduate study in Traffic; specializations in: Traffic, Post Traffic
Course: Traffic
Study programme type: professional
Study level: undergraduate
Academic / professional title: stručni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka prometa (stručni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka prometa)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2017-04-05 09:28:08