prikaz prve stranice dokumenta Pregled algoritama za traženje najkraćeg puta u grafu
  Download
PDF 1.14 MB
undergraduate thesis
Pregled algoritama za traženje najkraćeg puta u grafu
Zagreb: University of Zagreb, Faculty of Transport and Traffic Sciences, 2018. urn:nbn:hr:119:367599
Žunić, Salim
University of Zagreb
Faculty of Transport and Traffic Sciences
Division of Intelligent Transport Systems and Logistics
Department of Intelligent Transport Systems

Cite this document

Žunić, S. (2018). Pregled algoritama za traženje najkraćeg puta u grafu (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Transport and Traffic Sciences. Retrieved from https://urn.nsk.hr/urn:nbn:hr:119:367599

Žunić, Salim. "Pregled algoritama za traženje najkraćeg puta u grafu." Undergraduate thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, 2018. https://urn.nsk.hr/urn:nbn:hr:119:367599

Žunić, Salim. "Pregled algoritama za traženje najkraćeg puta u grafu." Undergraduate thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, 2018. https://urn.nsk.hr/urn:nbn:hr:119:367599

Žunić, S. (2018). 'Pregled algoritama za traženje najkraćeg puta u grafu', Undergraduate thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, accessed 21 March 2025, https://urn.nsk.hr/urn:nbn:hr:119:367599

Žunić S. Pregled algoritama za traženje najkraćeg puta u grafu [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Transport and Traffic Sciences; 2018 [cited 2025 March 21] Available at: https://urn.nsk.hr/urn:nbn:hr:119:367599

S. Žunić, "Pregled algoritama za traženje najkraćeg puta u grafu", Undergraduate thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, Zagreb, 2018. Available at: https://urn.nsk.hr/urn:nbn:hr:119:367599

Please login to the repository to save this object to your list.
Metadata
TitlePregled algoritama za traženje najkraćeg puta u grafu
Title (english)Overview of Algorithms for Shortest Path Problem
AuthorSalim Žunić
MentorJuraj Fosin (mentor)
Committee memberIvan Grgurević (predsjednik povjerenstva)
Committee memberZvonko Kavran (član povjerenstva)
Committee memberTonči Carić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Transport and Traffic Sciences
(Division of Intelligent Transport Systems and Logistics)
(Department of Intelligent Transport Systems)
Zagreb
Defense date and country2018-09-17, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Traffic and Transport Technology
Postal and Telecommunications Traffic
Abstract
U ovom radu prikazati će se pregled algoritama za traženje najkraćeg puta u grafu. Prikazani su Dijsktrin algoritam i Floyd-Warshallov algoritam, te su objašnjeni na primjerima manjih grafova. U prvom dijelu rada objašnjena je definicija grafova, osnovni načini prikaza grafova, te njihova osnovna podjela. Implementiran je Dijkstrin algoritam u programskom jeziku Java. Program je napravljen u razvojnom okruženju InteliJ. Algoritam je implementiran na primjeru grafa koji se sastoji od osam čvorova i simbolizira manju prometnu mrežu u informacijsko komunikacijskom prometu. Čvorovi grafa predstavljaju usmjerivače (engl. Router). Cilj programa je izračunati najmanje moguće količine kašnjenja od početnog čvora, do ostalih čvorova u mreži, odnosno grafu. Usmjeravanje u Internet prometu je proces pronalaženja puta kojim će se slati paketi od izvorišnog usmjerivača do odredišta. Cilj je da paketi na odredište stignu što brže, te se pri odlučivanju koriste algoritmi za traženje najkraćeg puta, poput Dijkstrinog algoritma implementiranog u ovom radu.
Abstract (english)
This paper presents overview of algorithms for the shortest path problem. It explains Dijkstra algorithm and Floyd-Warshalls algorithm that are explained on examples of smaller graphs. Definition of graphs, basic methods of graph presentation and their basic division are explained in fist part of the paper. Dijkstra algorithm is implemented in Java programing language. Program was made in InteliJ development environment. Algorithm is implemented on the example of graph which is made of eight nodes. Graph symbolizes smaller information and communication traffic network. Goal of program is to calculate delays from source node to all other nodes in network. Routing, in Internet traffic, is the process of choosing a path over which to send packets from source router to destination. Goal is for packets to be delivered as soon as possible, for decision making we are using shortest path algorithms as Dijsktra algorithm implemented in this paper.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:119:367599
Study programmeTitle: Traffic and Transport; specializations in: Road Traffic and Transport, Railway Traffic and Transport, Water Traffic and Transport, Air Traffic and Transport, Postal Traffic, Information and Communication Traffic, Urban Traffic and Transport
Course: Information and Communication Traffic
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka prometa (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka prometa)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
RepositoryFaculty of Transport and Traffic Sciences
Created on2018-09-20 16:48:07

(©) Nacionalna i sveučilišna knjižnica u Zagrebu 2015. Sva prava pridržana. | Hrvatske bratske zajednice 4 p.p. 550, 10000 Zagreb, Hrvatska Tel. ++ 385 1 616-4040
OIB: 84838770814 | IBAN: HR66 2340 0091 1000 1008 1, Porezni broj (PDV identifikacijski broj) - VAT Number: HR84838770814
Prijava u repozitorij