prikaz prve stranice dokumenta Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++
  Download
PDF 1.11 MB
undergraduate thesis
Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2024. urn:nbn:hr:200:247025
Balić, Igor
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics, Physics and Mechanical Engineering

Cite this document

Balić, I. (2024). Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++ (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:247025

Balić, Igor. "Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2024. https://urn.nsk.hr/urn:nbn:hr:200:247025

Balić, Igor. "Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2024. https://urn.nsk.hr/urn:nbn:hr:200:247025

Balić, I. (2024). 'Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 14 March 2025, https://urn.nsk.hr/urn:nbn:hr:200:247025

Balić I. Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++ [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2024 [cited 2025 March 14] Available at: https://urn.nsk.hr/urn:nbn:hr:200:247025

I. Balić, "Algoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2024. Available at: https://urn.nsk.hr/urn:nbn:hr:200:247025

Please login to the repository to save this object to your list.
Metadata
TitleAlgoritmi za pronalaženje najkraćeg puta u grafu u programskom jeziku C++
Title (english)Algorithms for finding shortest path in graphs in C++ programming language
AuthorIgor Balić
MentorTomislav Rudec (mentor)
MentorAlfonzo Baumgartner (sumentor)
Committee memberTomislav Rudec (predsjednik povjerenstva)
Committee memberVinko Petričević (član povjerenstva)
Committee memberŽeljka Mioković (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Core Courses)
(Chair of Mathematics, Physics and Mechanical Engineering)
Osijek
Defense date and country2024-10-07, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Program Engineering
Abstract
U ovom završnom radu cilj je bio opisati, pojasniti i usporediti najpoznatije i optimizirane algoritme za pronalazak najkraćeg puta u grafu s naglaskom na njihovu implementaciju i usporedbu u programskom jeziku C++. Problem najkraćeg puta je temelj za razne primjene u i rješavanje problema u računarstvu, mrežnom usmjeravanju i logistici. Prvo, predstavljamo osnovni koncept grafa i problem najkraćeg puta, definiramo grafove, što su bridovi, težine, čvorovi, usmjereni i neusmjereni graf, te... More graf s pozitivnim i negativnim težinama. Nakon toga definiramo način na koji prikazujemo grafove u matematičkom i računalnom smislu za najlakše pohranjivanje i rukovanje s njima te kako bismo ih mogli implementirati u programskom jeziku. Poslije detaljno opisujemo ključne algoritme za pronalazak najkraćeg puta u grafu, radimo detaljnu implementaciju tih algoritama u C++, uspoređujemo im performanse i testiramo ih s različitim podacima. Završni rad zaključujemo sa savjetima za odabir odgovarajućeg algoritma ovisno o potrebama i zahtjevima problema. Prvo, predstavljamo osnovni koncept grafa i problem najkraćeg puta, definiramo grafove, što su bridovi, težine, čvorovi, usmjereni i neusmjereni graf, te graf s pozitivnim i negativnim težinama. Nakon toga definiramo način na koji prikazujemo grafove u matematičkom i računalnom smislu za najlakše pohranjivanje i rukovanje s njima te kako bismo ih mogli implementirati u programskom jeziku. Poslije detaljno opisujemo ključne algoritme za pronalazak najkraćeg puta u grafu, radimo detaljnu implementaciju tih algoritama u C++, uspoređujemo im performanse i testiramo ih s različitim podacima. Završni rad zaključujemo sa savjetima za odabir odgovarajućeg algoritma ovisno o potrebama i zahtjevima problema. Less
Abstract (english)
This undergraduate thesis task was to describe in detail, explain and compare most common and optimized algorithms for shortest path problem in graph with accent on their implementation and comparison in C++ programming language. Shortest path problem is base for different system implementations in computer science, network routing and logistics. Firstly, we introduce base concepts of graphs and shortest path problem, defining graphs, what are edges, weights, nodes, or vertices, directed... More and undirected graph and graph with positive and negative edge weights. After that we define principle and mathematical form how we represent graphs in computer science for easiest storing in memory and handling with them so we could implement them in programming language. With detailed description we define key algorithms for shortest path problem in graph, making detail implementation in C++ of every described algorithm, we compare their performance and test them with different data sets. This work is concluded with tips for choosing appropriate algorithm depending on system and problem needs. Firstly, we introduce base concepts of graphs and shortest path problem, defining graphs, what are edges, weights, nodes, or vertices, directed and undirected graph and graph with positive and negative edge weights. After that we define principle and mathematical form how we represent graphs in computer science for easiest storing in memory and handling with them so we could implement them in programming language. With detailed description we define key algorithms for shortest path problem in graph, making detail implementation in C++ of every described algorithm, we compare their performance and test them with different data sets. This work is concluded with tips for choosing appropriate algorithm depending on system and problem needs. Less
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:247025
Study programmeTitle: Undergrauduate professinal studij programme in Commputer Engineering
Study programme type: professional
Study level: undergraduate
Academic / professional title: prvostupnik/prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (prvostupnik/prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
RepositoryFaculty of Electrical Engineering, Computer Science and Information Technology Osijek
Created on2024-10-27 14:56:03
accessibility

closeAccessibilityrefresh

If you wish to permanently save changes, click on Save, if not - your settings will be reset when you restart the browser.