prikaz prve stranice dokumenta Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu
No public access
undergraduate thesis
Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. urn:nbn:hr:168:822953
Avgustinović, Anto
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Avgustinović, A. (2017). Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:822953

Avgustinović, Anto. "Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:822953

Avgustinović, Anto. "Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:822953

Avgustinović, A. (2017). 'Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 17 July 2024, https://urn.nsk.hr/urn:nbn:hr:168:822953

Avgustinović A. Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2017 [cited 2024 July 17] Available at: https://urn.nsk.hr/urn:nbn:hr:168:822953

A. Avgustinović, "Problem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:168:822953

Metadata
TitleProblem najkraćeg puta s jednim izvorom u težinskom usmjerenom grafu
Title (english)Single Source Shortest Paths in Weighted Directed Graph
AuthorAnto Avgustinović
MentorAndrea Aglić Aljinović (mentor)
Committee memberAndrea Aglić Aljinović (predsjednik povjerenstva)
Committee memberJosipa Pina Milišić (član povjerenstva)
Committee memberOgnjen Dobrijević (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2017-09-13, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Electrical Engineering
Abstract
Problem najkraćeg puta sa jednim izvorom u težinskom usmjerenom grafu pripada matematičkoj grani koja se naziva teorija grafova, a ona pripada diskretnoj matematici. Taj problem je vrlo značajan u matematici, jer se primjenjuje u mnogim problemima u stvarnom svijetu. U ovom radu su prikazani osnovi pojmovi vezani uz graf, te dva algoritma za rješavanje problema navedenog iznad. Zadnji dio rada je vezan za programsku implementaciju koja rješava problem naveden iznad, pomoću Dijkstrinog ili Bellman-Fordovog algoritma. Shodno tome, izrađena je aplikacija sa pripadajućom programskom potporom, te je prikazan i izgled programa, kao i kratke upute za rad.
Abstract (english)
The problem of the shortest path with one source in the weight-oriented graph belongs to the mathematical branch called the graph theory, and it belongs to the discrete mathematicis. This problem is very important in mathematics, as it applies to many problems in the real world. In this paper, basic terms related to the graph are presented and also two algorithms for solving the problem mentioned above. The last part of the paper is related to a program implementation that solves the above problem, using the Dijststra or Bellman-Ford algorithm. Consequently, an application with accompanying program support was created, and the layout of the program, as well as short instructions for program operation, were displayed.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:822953
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 on2019-03-13 18:40:55