prikaz prve stranice dokumenta Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu
No public access
undergraduate thesis
Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. urn:nbn:hr:168:062968
Marcelić, Maroje
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Marcelić, M. (2017). Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:062968

Marcelić, Maroje. "Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:062968

Marcelić, Maroje. "Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:062968

Marcelić, M. (2017). 'Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 18 November 2024, https://urn.nsk.hr/urn:nbn:hr:168:062968

Marcelić M. Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2017 [cited 2024 November 18] Available at: https://urn.nsk.hr/urn:nbn:hr:168:062968

M. Marcelić, "Floyd-Warshallov algoritam za traženje najkraćih puteva u grafu", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:168:062968

Metadata
TitleFloyd-Warshallov algoritam za traženje najkraćih puteva u grafu
Title (english)Floyd-Warshall Algorithm for Finding Shortest Paths in a Graph
AuthorMaroje Marcelić
MentorTomislav Burić (mentor)
Committee memberTomislav Burić (predsjednik povjerenstva)
Committee memberAnamari Nakić (član povjerenstva)
Committee memberAna Anušić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2017-09-20, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Tema rada je traženje najkracih puteva u težinskom grafu. Potrebno je implementi- ´ rati i analizirati Floyd-Warshallov algoritam na razlicitim primjerima grafova. Korisnik ˇ pristupa aplikaciji kroz interaktivno sucelje koje treba ponuditi razne opcije generira- ˇ nja i unosa grafa.
Abstract (english)
Topic of the work is searching for shortest paths in weighted graph. It is required to implement an analyze Floyd-Warshall algorithm on different graph examples. User approaches the application through interactive interface that needs to offer different options of generating and entering a graph.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:062968
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 22:37:18