prikaz prve stranice dokumenta Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija
  Download
PDF 1.49 MB
master's thesis
Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija
2017. urn:nbn:hr:200:926089
Maligec, Matej
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Communications
Chair of Radiocommunications and Telecommunications

Cite this document

Maligec, M. (2017). Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija (Master's 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:926089

Maligec, Matej. "Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:926089

Maligec, Matej. "Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:926089

Maligec, M. (2017). 'Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija', Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 08 April 2024, https://urn.nsk.hr/urn:nbn:hr:200:926089

Maligec M. Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2017 [cited 2024 April 08] Available at: https://urn.nsk.hr/urn:nbn:hr:200:926089

M. Maligec, "Algoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija", Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:200:926089

Please login to the repository to save this object to your list.
Metadata
TitleAlgoritmi za pronalaženje najkraćih puteva u mreži i njihova programska implementacija
Title (english)Algorithms for Network Shortest Path Finding and their Software Implementation
AuthorMatej Maligec
MentorKrešimir Grgić (mentor)
Committee memberKrešimir Grgić (predsjednik povjerenstva)
Committee memberDrago Žagar (član povjerenstva)
Committee memberVišnja Križanović (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Communications)
(Chair of Radiocommunications and Telecommunications)
Osijek
Defense date and country2017-10-04, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Electrical Engineering
Telecommunications and Informatics
Abstract
Algoritmi za pronalaženje najkraćih puteva u mreži vrlo su bitni za brz i pouzdan prijenos podataka od početne to krajnje točke u mreži. Neki od tih algoritama su Dijkstrin, Bellman-Fordov i Floyd-Warshallov algoritam. Dijkstrin algoritam radi samo sa pozitivnim težinskim vrijednostima grana, dok Bellman-Fordov i Floyd-Warshallov algoritam mogu raditi i sa negativnim vrijednostima. Kod Bellman-Fordovog algoritma može doći do detekcije negativnog ciklusa, što znači da se vrijednost najkraćeg puta do određenog čvora može beskonačno smanjivati. Ukoliko negativan ciklus ne postoji, Dijkstrin i Bellman-Fordov algoritam imaju slično vrijeme izvođenja, dok Floyd-Warshallov algoritam ima najveće vrijeme izvođenja zbog prikaza izlaznih vrijednosti u obliku matrice te velikog broja mogućih međurješenja.
Abstract (english)
Shortest path algorithms are very important for fast and reliable data transportation from a starting to an ending point in a network. Some of these algorithms are Dijkstra's, Bellman-Ford's and Floyd-Warshall's algorithm. Dijkstra's algorithm works only with positive edge weights, whereas Bellman-Ford's and Floyd-Warshall's algorithms are able to work with negative edge weights aswell. Bellman-Ford's algorithm is capable of negative cycle detection, which means that the shortest path value to a specific vertex can be infinitely reduced. If there is no such cycle, Dijkstra's and Bellman-Ford's algorithms have a similar runtime, while Floyd-Warshall's algorithm has the greatest runtime of the three, because of the format of the output values being a data matrix and a large amount of possible intermediate solutions.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:926089
Study programmeTitle: Graduate University Study Programme in Electrical Engineering; specializations in: Communications and Informatics, Power Engineering
Course: Communications and Informatics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka elektrotehnike (magistar/magistra inženjer/inženjerka elektrotehnike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2017-10-25 15:48:50