prikaz prve stranice dokumenta Neki algoritmi za razapinjuća stabla u grafu
No public access
undergraduate thesis
Neki algoritmi za razapinjuća stabla u grafu
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2024. urn:nbn:hr:168:035261
Novosel, Dominik
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Novosel, D. (2024). Neki algoritmi za razapinjuća stabla u grafu (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:035261

Novosel, Dominik. "Neki algoritmi za razapinjuća stabla u grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2024. https://urn.nsk.hr/urn:nbn:hr:168:035261

Novosel, Dominik. "Neki algoritmi za razapinjuća stabla u grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2024. https://urn.nsk.hr/urn:nbn:hr:168:035261

Novosel, D. (2024). 'Neki algoritmi za razapinjuća stabla u grafu', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 02 December 2024, https://urn.nsk.hr/urn:nbn:hr:168:035261

Novosel D. Neki algoritmi za razapinjuća stabla u grafu [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2024 [cited 2024 December 02] Available at: https://urn.nsk.hr/urn:nbn:hr:168:035261

D. Novosel, "Neki algoritmi za razapinjuća stabla u grafu", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2024. Available at: https://urn.nsk.hr/urn:nbn:hr:168:035261

Metadata
TitleNeki algoritmi za razapinjuća stabla u grafu
Title (english)Some Algorithms for Spanning Trees in a Graph
AuthorDominik Novosel
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-06-27, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Rad istražuje različite algoritme pronalaska razapinjućih stabala u grafovima poput Kruskalovog, Primovog te algoritma za minimalni produkt. Analizira se vremenska i prostorna složenost svakog algoritma te se uspoređuju prednosti i nedostaci. Također su prikazani primjeri stvarne implementacije u svakodnevnom životu. Kroz teorijsku podlogu i praktične primjere rad daje sveobuhvatan pregled funkcioniranja i korištenja ovih algoritama za rješavanje konkretnih problema. Za svaki algoritam i obrađeno poglavlje prikazan je primjer pokretanja konkretnog programa te dobiveni ispisi i grafovi.
Abstract (english)
This paper explores various algorithms for finding spanning trees in graphs, such as Kruskal's algorithm, Prim's algorithm, and the minimum product algorithm. It analyzes the time and space complexity of each algorithm, comparing their advantages and disadvantages. Additionally, examples of real-world implementation in everyday life are presented. Through theoretical background and practical examples, the paper provides a comprehensive overview of the functioning and usage of these algorithms for solving specific problems. For each algorithm and discussed chapter, an example of running a specific program is provided, along with the resulting outputs and graphs.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:035261
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:41:32