prikaz prve stranice dokumenta Primjena Dijkstrinog algoritma u rješavanju labirinta
No public access
undergraduate thesis
Primjena Dijkstrinog algoritma u rješavanju labirinta
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2024. urn:nbn:hr:168:416129
Posnjak, Mirta
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Posnjak, M. (2024). Primjena Dijkstrinog algoritma u rješavanju labirinta (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:416129

Posnjak, Mirta. "Primjena Dijkstrinog algoritma u rješavanju labirinta." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2024. https://urn.nsk.hr/urn:nbn:hr:168:416129

Posnjak, Mirta. "Primjena Dijkstrinog algoritma u rješavanju labirinta." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2024. https://urn.nsk.hr/urn:nbn:hr:168:416129

Posnjak, M. (2024). 'Primjena Dijkstrinog algoritma u rješavanju labirinta', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 28 February 2025, https://urn.nsk.hr/urn:nbn:hr:168:416129

Posnjak M. Primjena Dijkstrinog algoritma u rješavanju labirinta [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2024 [cited 2025 February 28] Available at: https://urn.nsk.hr/urn:nbn:hr:168:416129

M. Posnjak, "Primjena Dijkstrinog algoritma u rješavanju labirinta", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2024. Available at: https://urn.nsk.hr/urn:nbn:hr:168:416129

Metadata
TitlePrimjena Dijkstrinog algoritma u rješavanju labirinta
Title (english)Application of Dijkstra's Algorithm in Solving Labyrinth Problem
AuthorMirta Posnjak
MentorMario Krnić (mentor)
Committee memberMario Krnić (predsjednik povjerenstva)
Committee memberTomislav Burić (član povjerenstva)
Committee memberLenka Mihoković (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2024-07-04, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
U ovom se radu proučava primjena Dijkstrinog algoritma u pronalaženju najkraćeg puta u labirintu. Algoritam je implementiran u Python, a njegova učinkovitost testirana je na različitim primjerima labirinta. Rezultati pokazuju da je Dijkstrin algoritam pouzdan i učinkovit za rješavanje navigacijskih problema u složenim sustavima te da se može dodatno optimizirati korištenjem heurističkih funkcija.
Abstract (english)
The use of Dijkstra's algorithm to determine the shortest path through mazes is examined in this paper. The Python implementation of the algorithm was tested for efficiency using a variety of maze examples. The outcomes demonstrated the effectiveness and dependability of Dijkstra's algorithm in resolving navigation issues in complex systems, with room for future optimization through the use of heuristic functions.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:416129
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 on2024-10-12 21:54:29