prikaz prve stranice dokumenta Rješavanje problema blokiranih putanja
Access restricted to students and staff of home institution
undergraduate thesis
Rješavanje problema blokiranih putanja
2017. urn:nbn:hr:166:035346
Bezmalinović, Adea
University of Split
Faculty of Science
Department of Informatics

Cite this document

Bezmalinović, A. (2017). Rješavanje problema blokiranih putanja (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:035346

Bezmalinović, Adea. "Rješavanje problema blokiranih putanja." Undergraduate thesis, University of Split, Faculty of Science, 2017. https://urn.nsk.hr/urn:nbn:hr:166:035346

Bezmalinović, Adea. "Rješavanje problema blokiranih putanja." Undergraduate thesis, University of Split, Faculty of Science, 2017. https://urn.nsk.hr/urn:nbn:hr:166:035346

Bezmalinović, A. (2017). 'Rješavanje problema blokiranih putanja', Undergraduate thesis, University of Split, Faculty of Science, accessed 25 December 2024, https://urn.nsk.hr/urn:nbn:hr:166:035346

Bezmalinović A. Rješavanje problema blokiranih putanja [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2017 [cited 2024 December 25] Available at: https://urn.nsk.hr/urn:nbn:hr:166:035346

A. Bezmalinović, "Rješavanje problema blokiranih putanja", Undergraduate thesis, University of Split, Faculty of Science, Split, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:166:035346

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema blokiranih putanja
Title (english)Solving blocked path problem
AuthorAdea Bezmalinović
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberDivna Krpan (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2017-09-20, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Poopćenje pronalaženja najkraćih puteva u nekom kvadratnom prostoru koji sadrži blokade, neprohodne dijelove prostora je problem pronalaska najkraćeg puta u bilo kojem neusmjerenom težinskom grafu u kojem nismo prikazali blokade, jer nemaju nikakvu važnost za algoritam takozvani Dijkstra algoritam. Mnogi praktični problemi se mogu reducirati na problem pronalaska najkraćeg puta. Istražena su rješenja koja heurističkim pristupom ili korištenjem nekonvencionalnih modela računala problem rješavaju u polinomijalnom vremenu. Prikazan je postupak optimalnog rješavanja poopćenog problema pronalaženja najkraćih puteva korištenjem algoritama pretraživanja. Algoritmi pretraživanja su implementirani u Pythonu. Rezultati njihovog izvršavanja su analizirani i praktički je dokazana vremenska složenost oblikovanih algoritama.
Abstract (english)
The fading of the shortest paths in a square area containing blockages, inadequate parts of the space, is the problem of finding the shortest path in any unedited weight graph in which we did not show blockages because they do not have any importance for the algorithm of the so-called Dijkstra algorithm. Many practical problems can be reduced to the problem of finding the shortest path. Solutions were explored by using a heuristic approach or using unconventional computer model problems in polynomial time. An optimum solution to the problem of finding the shortest path using search algorithms is presented. Search algorithms are implemented in Python. The results of their execution were analyzed and the time complexity of algorithms has practically been proved.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:035346
Study programmeTitle: Computer Science
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2018-03-27 16:13:02